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.
Chromatic Index Critical Graphs of Even Order with Five Major Vertices
β Scribed by Zi-Xia Song; H. P. Yap
- Publisher
- Springer Japan
- Year
- 2005
- Tongue
- English
- Weight
- 280 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We prove that a 2-connected graph of order 9 having maximum valency A 34 is chromatic index critical if and only if its valency-list is one of the following: 248, 3247 (except one graph), 258, 345 ', 4356, 26a, 356', 4267, 45266, 5465, 27', 367', 457', 46276, 52676, 56375, 6574, 57385, 6386, 627285,
We show that, for r = 1, 2, a graph G with 2n + 2 (26) vertices and maximum degree 2n + 1 -r is of Class 2 if and only if (E(G\v)I > ('"2+')m, where v is a vertex of G of minimum degree, and we make a conjecture for 1 s r s n, of which this result is a special case. For r = 1 this result is due to P
A chromatic-index-critical graph G on n vertices is non-trivial if it has at most n 2 edges. We prove that there is no chromatic-index-critical graph of order 12, and that there are precisely two non-trivial chromatic-index-critical graphs on 11 vertices. Together with known results this implies tha