✦ LIBER ✦

Discussions: Relating to the Graph of a Cubic Equation Having Complex Roots

✍ Scribed by Edwin S. Crawley

Book ID: 123797230
Publisher: Mathematical Association of America
Year: 1918
Tongue: English
Weight: 266 KB
Volume: 25
Category: Article
ISSN: 0002-9890
DOI: 10.2307/2972885

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Discussions: Relating to Approximations

Discussions: Relating to Approximations to Nearly Equal Roots of a Cubic Equation

✍ Paul Capron 📂 Article 📅 1918 🏛 Mathematical Association of America 🌐 English ⚖ 524 KB

Discussions: Relating to the Graph of Y

Discussions: Relating to the Graph of Y = f(X) for Complex Variables

✍ E. L. Rees 📂 Article 📅 1918 🏛 Mathematical Association of America 🌐 English ⚖ 217 KB

Discussion: Relating to a Construction f

Discussion: Relating to a Construction for the Graph of a Cubic

✍ Paul Capron 📂 Article 📅 1917 🏛 Mathematical Association of America 🌐 English ⚖ 387 KB

Discussions: Relating to a Solution of t

Discussions: Relating to a Solution of the Biquadratic Equation

✍ Enrique Cruchaga 📂 Article 📅 1918 🏛 Mathematical Association of America 🌐 English ⚖ 192 KB

A Simple Method for Graphically Obtainin

A Simple Method for Graphically Obtaining the Complex Roots of a Cubic Equation

✍ Rutherford E. Gleason 📂 Article 📅 1910 🏛 John Hopkins University Press 🌐 English ⚖ 629 KB

A note on the complexity of longest path

A note on the complexity of longest path problems related to graph coloring

✍ P.M. Pardalos; A. Migdalas 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 194 KB

In this note, we show that some problems related to the length of the longest simple path from a given vertex in a graph are NP-complete. We also discuss an extension to the graph coloring problem.