The structure of claw-free graphs
From MaRDI portal
Publication:3416248
zbMATH Open1109.05092MaRDI QIDQ3416248FDOQ3416248
Maria Chudnovsky, Paul Seymour
Publication date: 19 January 2007
Recommendations
Cited In (only showing first 100 items - show all)
- The complexity of rerouting shortest paths
- Induced disjoint paths in AT-free graphs
- 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
- On independent vertex sets in subclasses of apple-free graphs
- Square-free graphs with no induced fork
- Coloring fuzzy circular interval graphs
- Coloring fuzzy circular interval graphs
- Separation routine and extended formulations for the stable set problem in claw-free graphs
- Claw-free graphs with strongly perfect complements. Fractional and integral version. II: Nontrivial strip-structures
- An \(\mathcal{O}(m\log n)\) algorithm for the weighted stable set problem in claw-free graphs with \(\alpha ({G}) \leq 3\)
- On facets of stable set polytopes of claw-free graphs with stability number 3
- Detecting 2-joins faster
- On claw-free \(t\)-perfect graphs
- Lovász-Schrijver PSD-Operator on Claw-Free Graphs
- The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect
- Colouring squares of claw-free graphs
- Graphs with induced-saturation number zero
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants)
- A characterization of claw-free \(b\)-perfect graphs
- The maximum edit distance from hereditary graph properties
- Improved FPT algorithms for weighted independent set in bull-free graphs
- Domination When the Stars Are Out
- The stable set polytope of claw-free graphs with large stability number
- Results on the small quasi-kernel conjecture
- Characterizing and bounding the imperfection ratio for some classes of graphs
- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
- Title not available (Why is that?)
- Claw-free strictly Deza graphs
- Cycle traversability for claw-free graphs and polyhedral maps
- A twelve vertex theorem for 3-connected claw-free graphs
- Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs
- Some observations on the smallest adjacency eigenvalue of a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Claw-free graphs. VII. Quasi-line graphs
- Bounds on the regularity and projective dimension of ideals associated to graphs
- Distributed deterministic edge coloring using bounded neighborhood independence
- The stable set polytope of quasi-line graphs
- Title not available (Why is that?)
- On pancyclic claw-free graphs
- On Gorenstein graphs
- Paw-free graphs
- Clique-circulants and the stable set polytope of fuzzy circular interval graphs
- The stable set polytope of icosahedral graphs
- On some applications of the selective graph coloring problem
- A characterization of one class of graphs without 3-claws
- Clique or hole in claw-free graphs
- Parameterized complexity of induced graph matching on claw-free graphs
- On the facets of the stable set polytope of quasi-line graphs
- Edge decomposition of connected claw-free cubic graphs
- Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition
- Structure of 4-connected claw-free graphs not containing a subdivision of \(K_{5}\)
- A superlocal version of Reed's conjecture
- On distance-3 matchings and induced matchings
- A characterization of some graphs which do not contain 3-claws
- Minimum weighted clique cover on claw‐free perfect 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
- Asymptotics of the chromatic number for quasi-line graphs
- The \(k\)-in-a-path problem for claw-free graphs
- Claw-free graphs. IV: Decomposition theorem
- On the structure of graphs without claw, \(4K_1\) and co-R
- Distance-regular graphs without 4-claws
- Claw‐free circular‐perfect graphs
- Finding matching cuts in \(H\)-free graphs
- On the Erdős-Gyárfás conjecture in claw-free graphs
- Double-critical graph conjecture for claw-free graphs
- Counting kernels in directed graphs with arbitrary orientations
- Minimal claw-free graphs
- Disconnected cuts in claw-free graphs
- Coloring vertices of claw-free graphs in three colors
- A reduction algorithm for the weighted stable set problem in claw-free graphs
- A note on 2-bisections of claw-free cubic graphs
- Optimal chromatic bound for (P2+P3,P2+P3¯ ${P}_{2}+{P}_{3},\bar{{P}_{2}+{P}_{3}}$)‐free graphs
- The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs
- $t$-Perfection in $P_5$-Free Graphs
- On Sylvester Colorings of Cubic Graphs
- On claw-free asteroidal triple-free graphs
- Computation of the resistance distance and the Kirchhoff index for the two types of claw-free cubic graphs
- S_12 and P_12-colorings of cubic graphs
- Title not available (Why is that?)
- Cutting a tree with subgraph complementation is hard, except for some small trees
- Finding a smallest odd hole in a claw-free graph using global structure
- Cutting a tree with subgraph complementation is hard, except for some small trees
- Edge clique covers in graphs with independence number two
- An \(\mathcal{O} (n^2 \log{n})\) algorithm for the weighted stable set problem in claw-free graphs
- One-three join: a graph operation and its consequences
- Total coloring of the prismatic graphs
- On some graph classes related to perfect graphs: a survey
- Clique‐width: Harnessing the power of atoms
- Title not available (Why is that?)
- Dichotomies for maximum matching cut: \(H\)-freeness, bounded diameter, bounded radius
- When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time
- Claw-free circular-perfect graphs
- Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
- The structure of claw-free binary matroids
- Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
This page was built for publication: The structure of claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3416248)
