Claw-free graphs. I: Orientable prismatic graphs
From MaRDI portal
Publication:2384800
DOI10.1016/j.jctb.2007.02.002zbMath1128.05031OpenAlexW2036700147MaRDI QIDQ2384800
Maria Chudnovsky, P. D. Seymour
Publication date: 10 October 2007
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2007.02.002
Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Related Items
A note on the shameful conjecture, Padmakar-Ivan Index of Some Types of Perfect Graphs, On the complexity of colouring antiprismatic graphs, Claw-free graphs. VII. Quasi-line graphs, Dominating set is fixed parameter tractable in claw-free graphs, On the independent domination polynomial of a graph, Parameterized complexity of induced graph matching on claw-free graphs, A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free, An approximate version of Hadwiger's conjecture for claw-free graphs, Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey, Claw-free graphs. IV: Decomposition theorem, Claw-free graphs. V. Global structure, Claw-free graphs. II: Non-orientable prismatic graphs, On a conjecture on total domination in claw-free cubic graphs, Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey, Graphs without large apples and the maximum weight independent set problem, Total coloring of the prismatic graphs, Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ, Incompressibility of \(H\)-free edge modification problems: towards a dichotomy, Linear Balanceable and Subcubic Balanceable Graphs*, Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
Cites Work
