✦ LIBER ✦

Dirac's conjecture on K5-subdivisions

✍ Scribed by Carsten Thomassen

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 145 KB
Volume: 165-166
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00206-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A remark on Brauer's k(B)-conjecture

✍ Reinhard Knörr 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 476 KB

A short proof of a theorem of dirac's ab

A short proof of a theorem of dirac's about hadwiger's conjecture

✍ D. R. Woodall 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB 👁 1 views

## Abstract A Short proof is given of the theorem that every grph that does not have __K__~4~ as a subcontraction is properly vertex 3‐colorable.

Gauge generators, Dirac's conjecture, an

Gauge generators, Dirac's conjecture, and degrees of freedom for constrained systems

✍ X Gràcia; J.M Pons 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 784 KB

A necessary and sufficient condition for a function to be a generator of dynamical symmetry transformations in hamiltonian formalism is derived and presented in two forms, one of which involves an evolution operator connecting hamiltonian and lagrangian formalisms. As a particular case gauge transfo

Subdivision Number of Graphs and Falsity

Subdivision Number of Graphs and Falsity of a conjecture

✍ V. Swaminathan; P. Sumathi 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 67 KB

Do 3n − 5 edges force a subdivision of K

Do 3n − 5 edges force a subdivision of K5?

✍ André E. Kézdy; Patrick J. McGuinness 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 645 KB

## Abstract A conjecture of Dirac states that every simple graph with __n__ vertices and 3__n__ − 5 edges must contain a subdivision of __K__~5~. We prove that a topologically minimal counterexample is 5‐connected, and that no minor‐minimal counterexample contains __K__~4~ – __e__. Consequently, Di

Rao's conjecture on self-complementary g

Rao's conjecture on self-complementary graphs with K-factors

✍ Kiyoshi Ando 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB

## Abstract Rao posed the following conjecture, “Let G be a self‐complementary graph of order __p__, π = (d~1~ … dp) be its degree sequence. Then G has a k‐factor if and only if π − k, = (d1 − k, … dP − k) is graphical.” We construct a family of counterexamples for this conjecture for every k ⩾ 3.