Publication:3416248
From MaRDI portal
zbMath1109.05092MaRDI QIDQ3416248
Maria Chudnovsky, P. D. Seymour
Publication date: 19 January 2007
05C75: Structural characterization of families of graphs
Related Items
Claw-free circular-perfect graphs, Distributed deterministic edge coloring using bounded neighborhood independence, Claw‐free circular‐perfect graphs, Bounds on the regularity and projective dimension of ideals associated to graphs, The complexity of rerouting shortest paths, Graph classes and Ramsey numbers, The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect, On the recognition of fuzzy circular interval graphs, Coloring fuzzy circular interval graphs, On claw-free \(t\)-perfect graphs, On the facets of the stable set polytope of quasi-line graphs, A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants), A characterization of claw-free \(b\)-perfect graphs, On distance-3 matchings and induced matchings, The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect, Clique or hole in claw-free graphs, On independent vertex sets in subclasses of apple-free graphs, The maximum edit distance from hereditary graph properties, Clique-circulants and the stable set polytope of fuzzy circular interval graphs, The stable set polytope of quasi-line graphs, On facets of stable set polytopes of claw-free graphs with stability number 3, Characterizing and bounding the imperfection ratio for some classes of graphs, Some classical combinatorial problems on circulant and claw-free graphs: The isomorphism and coloring problems on circulant graphs and the stable set problem on claw-free graphs, Claw-free graphs. VII. Quasi-line graphs, Coloring vertices of claw-free graphs in three colors, Detecting 2-joins faster, The \(k\)-in-a-path problem for claw-free graphs, Finding a smallest odd hole in a claw-free graph using global structure, Structural results on circular-arc graphs and circle graphs: a survey and the main open problems, A reduction algorithm for the weighted stable set problem in claw-free graphs, Unnamed Item, Coloring Fuzzy Circular Interval Graphs, Domination When the Stars Are Out, Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs, Asymptotics of the chromatic number for quasi-line graphs, A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs, Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs, Minimal claw-free graphs, On Distance-3 Matchings and Induced Matchings
