On the structure of graphs without claw, \(4K_1\) and co-R

DOI10.1007/s00373-022-02517-8zbMath1493.05091OpenAlexW4286716144MaRDI QIDQ2158304

Chính T. Hoàng, Tala Abuadas

Publication date: 26 July 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-022-02517-8

zbMATH Keywords

graph coloringclawclique widthline-graphco-R

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• 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
• Recognizing claw-free perfect graphs
• The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
• A coloring algorithm for \(4 K_1\)-free line 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.
• Clique-width for 4-vertex forbidden subgraphs
• How To Color Claw-Free Perfect Graphs
• Characterizations of derived graphs

This page was built for publication: On the structure of graphs without claw, \(4K_1\) and co-R