Elementary graphs are chromatic-choosable
Narayanan N, Nandana K. Vasudevan, K. Somasundaram
Abstract
A graph is elementary if its edges can be coloured with two colours so that the two edges of every induced path on three vertices receive different colours. Elementary graphs are one of the two basic classes in the Chvátal--Sbihi decomposition of claw-free perfect graphs; they include all line graphs of bipartite multigraphs and all complements of bipartite graphs. We prove that every elementary graph G satisfies (G)=χ(G)=ω(G), confirming for this class the conjecture of Gravier and Maffray that claw-free graphs are chromatic-choosable. The proof combines the Maffray--Reed description of elementary graphs as augmentations of line graphs of bipartite multigraphs, Galvin's theorem, an extremal (edge-maximal) choice of counterexample, and a Hall-type lemma describing how list colourings of a complete graph minus a matching can fail.
Create a lesson
Related papers
Sensitivity of Rotation Symmetric Boolean Functions via Binary Necklaces
Yuan Li, Jing Zhang
On the Stability of the Independence Number of the Distance Graph G(n,r,<s) for Growing r and s
Vsevolod A. Pokhachevskiy, Andrei Raigorodskii
On Intersection Hypergraph of Finite Non-Cyclic Abelian Groups
A N Ardra, S Ballal
The quarter-point theorem for Gromov hyperbolic graphs
Walter Carballosa, Jesus Mendez, Rosalio Reyes et al.
Finite noncommutative coinvariant algebras
Farid Aliniaeifard, Nantel Bergeron, Huilan Li et al.
Very high genus double Hurwitz numbers via mixing times
Baptiste Louf, Lucas Teyssier