On the structure of graphs without claw, 4K₁ and co-R

DOI10.1007/S00373-022-02517-8MaRDI QIDQ2158304zbMATH OpenOpenAlexFDO

Authors Tala Abuadas, Chính T. Hoàng

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) Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• scientific article; zbMATH DE number 1753165
• Structure of 4-connected claw-free graphs not containing a subdivision of \(K_{5}\)
• The structure of claw-free graphs
• On distance-regular graphs without 4-claws
• A revision and extension of results on 4-regular, 4-connected, claw-free graphs
• Claw-free graphs. IV: Decomposition theorem
• Claw-free graphs. V. Global structure
• Claw-free graphs---a survey
• Vertex disjoint copies of \(K_{1 , 4}\) in claw-free graphs
• On 4-connected claw-free well-covered graphs

Cites work

• scientific article; zbMATH DE number 3882470 (Why is no real title available?)
• scientific article; zbMATH DE number 1979486 (Why is no real title available?)
• A coloring algorithm for \(4 K_1\)-free line graphs
• Characterizations of derived graphs
• Clique-width for 4-vertex forbidden subgraphs
• How To Color Claw-Free Perfect Graphs
• Linear time solvable optimization problems on graphs of bounded clique-width
• MSOL partitioning problems on graphs of bounded treewidth and clique-width
• On coloring a class of claw-free graphs.
• Recognizing claw-free perfect graphs
• The strong perfect graph theorem
• The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
• Topics on perfect graphs
• Upper bounds to the clique width of graphs
• Vertex coloring of graphs with few obstructions

Cited in

(8)

• scientific article; zbMATH DE number 1753165 (Why is no real title available?)
• The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable
• On the structure and clique‐width of (4K1,C4,C6,C7)‐free graphs
• Vertex coloring \((4K_1\), hole-twin, 5-wheel)-free graphs
• On the geometricity of distance-regular graphs without 4-claws
• Some results on the reconstruction problems. p‐claw‐free, chordal, and p₄‐reducible graphs
• Structure of 4-connected claw-free graphs not containing a subdivision of \(K_{5}\)
• A note on coloring \((4K_1, C_4, C_6)\)-free graphs with a \(C_7\)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2158304)