Claw-free graphs. I: Orientable prismatic graphs
From MaRDI portal
Recommendations
Cited in
(27)- Linear balanceable and subcubic balanceable graphs
- A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free
- Graphs without large apples and the maximum weight independent set problem
- Claw-free graphs. II: Non-orientable prismatic graphs
- On a conjecture on total domination in claw-free cubic graphs
- On the independent domination polynomial of a graph
- Claw-free graphs. V. Global structure
- A note on the shameful conjecture
- Blocks in graphs of a class of claw-free and 3-colorable graphs
- Prime orientable graphs
- Growing without cloning
- Claw-free graphs. VII. Quasi-line graphs
- The structure of claw-free graphs
- Total coloring of the prismatic graphs
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
- Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
- On the complexity of colouring antiprismatic graphs
- An approximate version of Hadwiger's conjecture for claw-free graphs
- Parameterized complexity of induced graph matching on claw-free graphs
- Dominating set is fixed parameter tractable in claw-free graphs
- Padmakar-Ivan Index of Some Types of Perfect Graphs
- Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey
- Incompressibility of \(H\)-free edge modification problems: towards a dichotomy
- Coloring bridge-free antiprismatic graphs
- Claw-free graphs, skeletal graphs, and a stronger conjecture on , , and
- Claw-free graphs. IV: Decomposition theorem
- A new method for computing the vertex PI index with applications to special classes of graphs
This page was built for publication: Claw-free graphs. I: Orientable prismatic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2384800)