Publication | Open Access
How Many Conjectures Can You Stand? A Survey
25
Citations
46
References
2011
Year
Geometry Of NumberGeometric Graph TheoryComputational Number TheoryGraph TheoryAlgebraic Graph TheoryTopological Graph TheoryHamiltonian Graph TheoryMany ConjecturesExtremal Graph TheoryP Versus Np ProblemOpen ProblemsDiscrete MathematicsSurvey ResultsTopological CombinatoricsStatistics
We survey results and open problems in hamiltonian graph theory centered around two conjectures of the 1980s that are still open: every 4-connected claw-free graph (line graph) is hamiltonian. These conjectures have lead to a wealth of interesting concepts, techniques, results and equivalent conjectures.
| Year | Citations | |
|---|---|---|
Page 1
Page 1