Claw-free graphs. III: Circular interval graphs
From MaRDI portal
Publication:933683
DOI10.1016/j.jctb.2008.03.001zbMath1158.05035OpenAlexW2063762035WikidataQ60307430 ScholiaQ60307430MaRDI QIDQ933683
Maria Chudnovsky, P. D. Seymour
Publication date: 24 July 2008
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.2008.03.001
Related Items
A note on the shameful conjecture, Clique-coloring claw-free graphs, On dominating set polyhedra of circular interval graphs, Claw-free graphs. VI: Colouring, Graph classes and Ramsey numbers, Strongly perfect claw‐free graphs—A short proof, Rainbow independent sets in certain classes of graphs, On the recognition of fuzzy circular interval graphs, Claw-free graphs with strongly perfect complements. Fractional and integral version. I: Basic graphs, On the facets of the stable set polytope of quasi-line graphs, Hadwiger's conjecture for quasi-line graphs, The graph formulation of the union-closed sets conjecture, Dominating set is fixed parameter tractable in claw-free graphs, On the independent domination polynomial of a graph, Clique-width with an inactive label, 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, 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, Partial characterizations of clique-perfect graphs I: Subclasses of claw-free 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, Incompressibility of \(H\)-free edge modification problems: towards a dichotomy
Cites Work
