Claw-free graphs. VII. Quasi-line graphs
From MaRDI portal
Publication:1931400
DOI10.1016/j.jctb.2012.07.005zbMath1258.05055OpenAlexW2019761982MaRDI QIDQ1931400
Maria Chudnovsky, P. D. Seymour
Publication date: 14 January 2013
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.2012.07.005
Related Items (23)
On the minimum and maximum selective graph coloring problems in some graph classes ⋮ Integer round-up property for the chromatic number of some \(h\)-perfect graphs ⋮ On some applications of the selective graph coloring problem ⋮ Hadwiger's conjecture for squares of 2-trees ⋮ Some remarks on even-hole-free graphs ⋮ Hadwiger's Conjecture for Graphs with Forbidden Holes ⋮ Minimum weighted clique cover on claw‐free perfect graphs ⋮ Asymptotics of the chromatic number for quasi-line graphs ⋮ Colouring squares of claw-free graphs ⋮ Hadwiger's conjecture for quasi-line graphs ⋮ Colouring Squares of Claw-free Graphs ⋮ Parameterized complexity of induced graph matching on claw-free graphs ⋮ A note on the Chvátal-rank of clique family inequalities ⋮ Gear composition and the stable set polytope ⋮ Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey ⋮ Claw-free circular-perfect graphs ⋮ Erdős-Lovász Tihany conjecture for graphs with forbidden holes ⋮ Incompressibility of \(H\)-free edge modification problems: towards a dichotomy ⋮ Counting Weighted Independent Sets beyond the Permanent ⋮ The Erdős-Lovász tihany conjecture for quasi-line graphs ⋮ Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition ⋮ On the Stable Set Polytope of Claw-Free Graphs ⋮ Almost all webs are not rank-perfect
Cites Work
This page was built for publication: Claw-free graphs. VII. Quasi-line graphs
