A k-critical (multi-) graph G has maximum degree k, chromatic index χ (G) = k + 1, and χ (G -e) < k + 1 for each edge e of G. For each k ≥ 3, we construct k-critical (multi-) graphs with certain properties to obtain counterexamples to some well-known conjectures.
✦ LIBER ✦
3- and 4-critical graphs of small even order
✍ Scribed by G. Brinkmann; E. Steffen
- Book ID
- 108316062
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 248 KB
- Volume
- 169
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Chromatic-index-critical graphs of even
✍
Gr�newald, Stefan; Steffen, Eckhard
📂
Article
📅
1999
🏛
John Wiley and Sons
🌐
English
⚖ 298 KB
👁 2 views
Regular 4-critical graphs of even degree
✍
Andrey A. Dobrynin; Leonid S. Melnikov; Artem V. Pyatkin
📂
Article
📅
2004
🏛
John Wiley and Sons
🌐
English
⚖ 237 KB
👁 1 views
## Abstract In 1960, Dirac posed the conjecture that __r__‐connected 4‐critical graphs exist for every __r__ ≥ 3. In 1989, Erdős conjectured that for every __r__ ≥ 3 there exist __r__‐regular 4‐critical graphs. In this paper, a technique of constructing __r__‐regular __r__‐connected vertex‐transiti
Stability Critical Graphs and Even Subdi
✍
E.C. Sewell; L.E. Trotter
📂
Article
📅
1993
🏛
Elsevier Science
🌐
English
⚖ 375 KB
Chromatic Index Critical Graphs of Even
✍
Zi-Xia Song; H. P. Yap
📂
Article
📅
2005
🏛
Springer Japan
🌐
English
⚖ 280 KB
Matchings in 3-vertex-critical graphs: T
✍
Nawarat Ananchuen; Michael D. Plummer
📂
Article
📅
2005
🏛
John Wiley and Sons
🌐
English
⚖ 104 KB
Even cycle decompositions of 4-regular g
✍
Klas Markström
📂
Article
📅
2012
🏛
Elsevier Science
🌐
English
⚖ 367 KB