The structure of claw-free graphs
From MaRDI portal
Publication:3416248
Recommendations
Cited in
(only showing first 100 items - show all)- Coloring of some crown-free graphs
- Partitioning \(H\)-free graphs of bounded diameter
- Claw-free graphs with non-clique μ-subgraphs and related geometries
- On distance-3 matchings and induced matchings
- scientific article; zbMATH DE number 6302876 (Why is no real title available?)
- Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs
- On Sylvester colorings of cubic graphs
- On graphs G for which both G and G are claw-free
- Parameterized complexity of induced graph matching on claw-free graphs
- Contracting to a longest path in H-free graphs
- On the facets of the stable set polytope of quasi-line graphs
- The (theta, wheel)-free graphs. II: Structure theorem
- Structure of 4-connected claw-free graphs not containing a subdivision of \(K_{5}\)
- Edge decomposition of connected claw-free cubic graphs
- Graphs without five-vertex path and four-vertex cycle
- 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
- 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
- Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs
- Minimum weighted clique cover on claw‐free perfect graphs
- The \(k\)-in-a-path problem for claw-free graphs
- Claw-free graphs. IV: Decomposition theorem
- scientific article; zbMATH DE number 5938875 (Why is no real title available?)
- On the structure of graphs without claw, \(4K_1\) and co-R
- A multiscale method for data collected from network edges via the line graph
- The \(e\)-positivity of two classes of cycle-chord graphs
- Distance-regular graphs without 4-claws
- The feasibility problem for line graphs
- On claw-free graphs with all but four eigenvalues equal to \(0\) or \(-1\)
- Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs
- Double-critical graph conjecture for claw-free graphs
- The complexity of rerouting shortest paths
- Claw-free circular-perfect graphs
- Solving the weighted stable set problem in claw-free graphs via decomposition
- On the Erdős-Gyárfás conjecture in claw-free graphs
- Finding matching cuts in \(H\)-free graphs
- Planarization and acyclic colorings of subcubic claw-free graphs
- Counting kernels in directed graphs with arbitrary orientations
- Graph classes and Ramsey numbers
- Set graphs. IV. Further connections with claw-freeness
- 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
- Minimal claw-free graphs
- Disconnected cuts in claw-free graphs
- On independent vertex sets in subclasses of apple-free graphs
- Square-free graphs with no induced fork
- 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
- Coloring fuzzy circular interval graphs
- Claw-free graphs with strongly perfect complements. Fractional and integral version. II: Nontrivial strip-structures
- Separation routine and extended formulations for the stable set problem in claw-free graphs
- Coloring fuzzy circular interval graphs
- A note on 2-bisections of claw-free cubic graphs
- On claw-free t-perfect graphs
- On facets of stable set polytopes of claw-free graphs with stability number 3
- The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect
- An \(\mathcal{O}(m\log n)\) algorithm for the weighted stable set problem in claw-free graphs with \(\alpha ({G}) \leq 3\)
- List-coloring claw-free graphs with \(\Delta-1\) colors
- Detecting 2-joins faster
- Graphs with induced-saturation number zero
- Fixed-point definability and polynomial time on chordal graphs and line graphs
- Colouring squares of claw-free graphs
- The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs
- Optimal chromatic bound for (P2+P3,P2+P3¯ ${P}_{2}+{P}_{3},\bar{{P}_{2}+{P}_{3}}$)‐free graphs
- 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
- Claw-free graphs. III: Circular interval graphs
- The maximum edit distance from hereditary graph properties
- Improved FPT algorithms for weighted independent set in bull-free graphs
- Max weight independent set in graphs with no long claws: an analog of the Gyárfás' path argument
- The stable set polytope of claw-free graphs with large stability number
- On claw-free asteroidal triple-free graphs
- Claw-free graphs. V. Global structure
- Lovász-Schrijver PSD-operator on claw-free graphs
- Clawfreeness of the powers of a graph
- Characterizing and bounding the imperfection ratio for some classes of graphs
- Computation of the resistance distance and the Kirchhoff index for the two types of claw-free cubic graphs
- Results on the small quasi-kernel conjecture
- scientific article; zbMATH DE number 5525657 (Why is no real title available?)
- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
- 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
- A twelve vertex theorem for 3-connected claw-free graphs
- Claw-free strictly Deza graphs
- scientific article; zbMATH DE number 7274067 (Why is no real title available?)
- Cycle traversability for claw-free graphs and polyhedral maps
- Cutting a tree with subgraph complementation is hard, except for some small trees
- Squared chromatic number without claws or large cliques
- Some observations on the smallest adjacency eigenvalue of a graph
- Non-conflicting no-where zero Z₂ Z₂-flows in cubic graphs
- scientific article; zbMATH DE number 4135992 (Why is no real title available?)
- The structure of claw-free perfect graphs
- scientific article; zbMATH DE number 140465 (Why is no real title available?)
- Edge clique covers in graphs with independence number two
- Growing without cloning
- Colouring squares of claw-free graphs
- An \(\mathcal{O} (n^2 \log{n})\) algorithm for the weighted stable set problem in claw-free graphs
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)
