The structure of claw-free graphs
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- 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
- Paw-free graphs
- A description of claw-free perfect graphs
- A characterization of some graphs which do not contain 3-claws
- A strengthening of Ben Rebea's lemma
- On claw-free asteroidal triple-free graphs
- Improved FPT algorithms for weighted independent set in bull-free graphs
- Colouring squares of claw-free graphs
- A note on 2-bisections of claw-free cubic graphs
- Claw-free graphs. VII. Quasi-line graphs
- Separation routine and extended formulations for the stable set problem in claw-free graphs
- The structure of claw-free binary matroids
- Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
- The feasibility problem for line graphs
- On the structure of graphs without claw, \(4K_1\) and co-R
- Partitioning \(H\)-free graphs of bounded diameter
- The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs
- The (theta, wheel)-free graphs. II: Structure theorem
- On some graph classes related to perfect graphs: a survey
- Disconnected cuts in claw-free graphs
- Cycle traversability for claw-free graphs and polyhedral maps
- An \(\mathcal{O} (n^2 \log{n})\) algorithm for the weighted stable set problem in claw-free graphs
- On Gorenstein graphs
- Coloring vertices of claw-free graphs in three colors
- Graphs without five-vertex path and four-vertex cycle
- Some observations on the smallest adjacency eigenvalue of a graph
- Normal 6-edge-colorings of some bridgeless cubic graphs
- Distance-regular graphs without 4-claws
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
- One-three join: a graph operation and its consequences
- An \(\mathcal{O}(m\log n)\) algorithm for the weighted stable set problem in claw-free graphs with \(\alpha ({G}) \leq 3\)
- Detecting 2-joins faster
- Claw-free strictly Deza graphs
- 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
- On the Erdős-Gyárfás conjecture in claw-free graphs
- On some applications of the selective graph coloring problem
- On dominating set polyhedra of circular interval graphs
- The \(e\)-positivity of two classes of cycle-chord graphs
- On pancyclic claw-free graphs
- Graphs with induced-saturation number zero
- Lovász-Schrijver PSD-operator on claw-free graphs
- Coloring fuzzy circular interval graphs
- The stable set polytope of claw-free graphs with large stability number
- Growing without cloning
- A twelve vertex theorem for 3-connected claw-free graphs
- scientific article; zbMATH DE number 5844212 (Why is no real title available?)
- Planarization and acyclic colorings of subcubic claw-free graphs
- Squared chromatic number without claws or large cliques
- Claw-free graphs with non-clique μ-subgraphs and related geometries
- scientific article; zbMATH DE number 4135992 (Why is no real title available?)
- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
- Bounds on the regularity and projective dimension of ideals associated to graphs
- Fixed-point definability and polynomial time on chordal graphs and line graphs
- scientific article; zbMATH DE number 5525657 (Why is no real title available?)
- Minimal claw-free graphs
- On distance-3 matchings and induced matchings
- The complexity of rerouting shortest paths
- Graph classes and Ramsey numbers
- Set graphs. IV. Further connections with claw-freeness
- scientific article; zbMATH DE number 140465 (Why is no real title available?)
- 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
- Claw-free graphs with strongly perfect complements. Fractional and integral version. II: Nontrivial strip-structures
- Coloring fuzzy circular interval graphs
- Clawfreeness of the powers of a graph
- On claw-free t-perfect graphs
- scientific article; zbMATH DE number 1532668 (Why is no real title available?)
- On Sylvester colorings of cubic graphs
- Colouring squares of claw-free graphs
- Parameterized complexity of induced graph matching on claw-free graphs
- A superlocal version of Reed's conjecture
- Total coloring of the prismatic graphs
- Disconnected cuts in claw-free graphs
- Total coloring of quasi-line graphs and inflated graphs
- When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time
- scientific article; zbMATH DE number 7274067 (Why is no real title available?)
- scientific article; zbMATH DE number 5938875 (Why is no real title available?)
- \(S_{12}\) and \(P_{12}\)-colorings of cubic graphs
- Induced disjoint paths in claw-free graphs
- Double-critical graph conjecture for claw-free graphs
- List-coloring claw-free graphs with -1 colors
- \(t\)-perfection in \(P_5\)-free graphs
- Structure of 4-connected claw-free graphs not containing a subdivision of \(K_{5}\)
- The structure of claw-free perfect graphs
- scientific article; zbMATH DE number 6302876 (Why is no real title available?)
- On graphs G for which both G and G are claw-free
- Solving the weighted stable set problem in claw-free graphs via decomposition
- Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs
- Claw-free circular-perfect graphs
- Claw-free circular-perfect graphs
- Distributed deterministic edge coloring using bounded neighborhood independence
- Results on the small quasi-kernel conjecture
- Finding matching cuts in \(H\)-free graphs
- Minimum weighted clique cover on claw‐free perfect graphs
- Edge clique covers in graphs with independence number two
- Clique‐width: Harnessing the power of atoms
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)
