๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On 4-chromatic edge-critical regular graphs of high connectivity

โœ Scribed by Andrey A. Dobrynin; Leonid S. Melnikov; Artem V. Pyatkin

Book ID
108315831
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
81 KB
Volume
260
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the Size of Edge Chromatic Critical G
On the Size of Edge Chromatic Critical Graphs
โœ Daniel P. Sanders; Yue Zhao ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 85 KB

In this paper, by applying the discharging method, we prove that if

There are no edge-chromatic 4-critical g
There are no edge-chromatic 4-critical graphs of order 12
โœ S.A. Choudum; K. Kayathri ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 269 KB

We prove that there are no edge-chromatic 4-critical graphs of order 12. ## 1. Introduction A well-known theorem of Vizing [4] states that: ifG is a simple graph with maximum degree A, then the edge chromatic number z'(G) of G is A or A + 1. A graph G is said to be of class 1 if z'(G) = A, and it

On 4-critical planar graphs with high ed
On 4-critical planar graphs with high edge density
โœ Gerhard Koester ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 236 KB

Koester, G., On 4-critical planar graphs with high edge density, Discrete Mathematics 98 (1991) 147-151.