The chromaticity of complete split graphs

DOI10.22405/2226-8383-2024-25-2-208-221MaRDI QIDQ6647871

Hung Xuan Le

Publication date: 3 December 2024

Published in: Chebyshevskiĭ Sbornik (Search for Journal in Brave)

zbMATH Keywords

complete split graphlist-chromatic numberchromatically uniqueuniquely list colorable graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The search for chromatically unique graphs
• Necessary conditions for Hamiltonian split graphs
• A note on Hamiltonian split graphs
• The search for chromatically unique graphs. II
• A determinant formula for the number of ways of coloring a map.
• Some conclusion on unique \(k\)-list colorable complete multipartite graphs
• Toughness, hamiltonicity and split graphs
• On colorings of split graphs
• On the Burkard-Hammer condition for Hamiltonian split graphs
• Bisplit graphs
• Expansions of Chromatic Polynomials and Log-Concavity
• A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives
• On chromatic equivalence of graphs
• Hamilton cycles in split graphs with large minimum degree
• Unique list colorability of the graph Кn2 + Kr
• The Colour Numbers of Complete Graphs
• An introduction to chromatic polynomials
• Colorings of the Graph K ᵐ 2 + Kn
• Uniquely list colorability of complete tripartite graphs
• On an estimate of the chromatic class of a \(p\)-graph

This page was built for publication: The chromaticity of complete split graphs