Pages that link to "Item:Q947722"
From MaRDI portal
The following pages link to Claw-free graphs. IV: Decomposition theorem (Q947722):
Displaying 50 items.
- The equivalence number of a line graph (Q350825) (← links)
- The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect (Q403365) (← links)
- Graphs of separability at most 2 (Q415268) (← links)
- Clawfreeness of the powers of a graph (Q423974) (← links)
- On graphs with no induced subdivision of \(K_4\) (Q444381) (← links)
- Parameterized complexity of induced graph matching on claw-free graphs (Q487013) (← links)
- Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey (Q498431) (← links)
- Dominating set is fixed parameter tractable in claw-free graphs (Q650938) (← links)
- A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free (Q666001) (← links)
- On a conjecture on total domination in claw-free cubic graphs (Q710600) (← links)
- Graphs without large apples and the maximum weight independent set problem (Q742580) (← links)
- Clique or hole in claw-free graphs (Q765186) (← links)
- Clique-coloring of \(K_{3,3}\)-minor free graphs (Q826557) (← links)
- Claw-free graphs. III: Circular interval graphs (Q933683) (← links)
- Claw-free graphs. V. Global structure (Q958695) (← links)
- Gear composition and the stable set polytope (Q1003487) (← links)
- Paw-free graphs (Q1108293) (← links)
- A description of claw-free perfect graphs (Q1306428) (← links)
- A strengthening of Ben Rebea's lemma (Q1321993) (← links)
- A note on the shameful conjecture (Q1631622) (← links)
- Claw-free graphs. VII. Quasi-line graphs (Q1931400) (← links)
- The structure of claw-free binary matroids (Q2040015) (← links)
- Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey (Q2042199) (← links)
- Declawing a graph: polyhedra and branch-and-cut algorithms (Q2045043) (← links)
- Incompressibility of \(H\)-free edge modification problems: towards a dichotomy (Q2071824) (← links)
- The existence of planar 4-connected essentially 6-edge-connected graphs with no claw-decompositions (Q2105863) (← links)
- On the structure of graphs without claw, \(4K_1\) and co-R (Q2158304) (← links)
- Coloring graph classes with no induced fork via perfect divisibility (Q2161205) (← links)
- Excluding the fork and antifork (Q2305900) (← links)
- Claw-free graphs. I: Orientable prismatic graphs (Q2384800) (← links)
- Polynomial kernelization for removing induced claws and diamonds (Q2398208) (← links)
- Claw-free strictly Deza graphs (Q2403679) (← links)
- Claw-free graphs. II: Non-orientable prismatic graphs (Q2477624) (← links)
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs (Q2482103) (← links)
- Vertex elimination orderings for hereditary graph classes (Q2514166) (← links)
- Clique-coloring claw-free graphs (Q2631088) (← links)
- Polynomial Kernelization for Removing Induced Claws and Diamonds (Q2827828) (← links)
- The stable set polytope of claw-free graphs with large stability number (Q2861525) (← links)
- Growing without cloning (Q2910955) (← links)
- Graphs of Separability at Most Two: Structural Characterizations and Their Consequences (Q3000517) (← links)
- Decomposition of a Complete Multi-Partite Graph into Isomorphic Claws (Q3708843) (← links)
- Some results on the reconstruction problems. <i>p</i>‐claw‐free, chordal, and <i>p</i><sub>4</sub>‐reducible graphs (Q4842708) (← links)
- Set Graphs. V. On representing graphs as membership digraphs (Q5262489) (← links)
- Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)
- List-Coloring Claw-Free Graphs with $\Delta-1$ Colors (Q5346550) (← links)
- Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition (Q5501925) (← links)
- On the Stable Set Polytope of Claw-Free Graphs (Q5505672) (← links)
- A Polynomial Kernel for Line Graph Deletion (Q5874512) (← links)
- (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels (Q6080861) (← links)
- (Q6089654) (← links)