Coloring rings

DOI10.1002/jgt.22635zbMath1526.05052arXiv1907.11905MaRDI QIDQ6055414

Irena Penev, Frédéric Maffray, Kristina Vušković

Publication date: 29 September 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.11905

zbMATH Keywords

algorithmschromatic numbervertex coloringHadwiger's conjectureoptimal \(\chi\)-bounding function

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

On the structure and clique‐width of (4K1,C4,C6,C7)‐free graphs ⋮ A class of graphs with large rankwidth ⋮ Coloring \((4K_1,C_4,C_6)\)-free graphs

Cites Work

• A note on two problems in connexion with graphs
• On rigid circuit graphs
• The strong perfect graph theorem
• Decomposition by clique separators
• On simplicial and co-simplicial vertices in graphs.
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Incidence matrices and interval graphs
• Normal hypergraphs and the perfect graph conjecture
• The world of hereditary graph classes viewed through Truemper configurations
• Algorithmic Aspects of Vertex Elimination on Graphs
• ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
• Paths, Trees, and Flowers
• Clique‐cutsets beyond chordal graphs
• Static frequency assignment in cellular networks

This page was built for publication: Coloring rings