Vertex coloring \((4K_1\), hole-twin, 5-wheel)-free graphs

DOI10.1016/j.tcs.2022.02.009zbMath1493.68263OpenAlexW4212817891MaRDI QIDQ2124227

Yingjun Dai, Angèle M. Foley, Chính T. Hoàng

Publication date: 19 April 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.02.009

zbMATH Keywords

graph coloringpolynomial-time algorithmhole-twin5-wheel

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Vertex coloring of graphs with few obstructions
• Topics on perfect graphs
• The strong perfect graph theorem
• MSOL partitioning problems on graphs of bounded treewidth and clique-width
• A coloring algorithm for \(4 K_1\)-free line graphs
• Algorithmic graph theory and perfect graphs
• Linear time solvable optimization problems on graphs of bounded clique-width
• Upper bounds to the clique width of graphs
• On coloring a class of claw-free graphs.
• Characterizations of \((4 K_1,C_4,C_5)\)-free graphs
• Clique-width for 4-vertex forbidden subgraphs
• Recognizing Berge graphs
• Characterizations of derived graphs

This page was built for publication: Vertex coloring \((4K_1\), hole-twin, 5-wheel)-free graphs