Cycles through particular subgraphs of claw‐free graphs
From MaRDI portal
Publication:4857445
DOI10.1002/JGT.3190200409zbMATH Open0835.05042OpenAlexW1979413926MaRDI QIDQ4857445FDOQ4857445
Authors:
Publication date: 8 April 1996
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://research.utwente.nl/en/publications/cycles-through-particular-subgraphs-of-clawfree-graphs(e2622aa7-60dc-48de-afe0-d3349b8767a4).html
Recommendations
Cites Work
Cited In (18)
- Hamiltonicity of 4-connected graphs
- Degree sum conditions for the circumference of 4-connected graphs
- Relative length of longest paths and cycles in graphs
- A nine vertex theorem for 3-connected claw- free graphs
- Cycles through given vertices and closures
- Cycle traversability for claw-free graphs and polyhedral maps
- Claw-free graphs---a survey
- On 3-stable number conditions in \(n\)-connected claw-free graphs
- Longest cycles in 4-connected graphs
- On cycle-nice claw-free graphs
- Tank-ring factors in supereulerian claw-free graphs
- Title not available (Why is that?)
- Forbidden subgraphs for longest cycles to contain vertices with large degrees
- Clique or hole in claw-free graphs
- Sequences, claws and cyclability of graphs
- Neighborhood unions and cyclability of graphs
- Cycles in squares of trees without generalized claws
- Critical graphs for subpancyclicity of 3-connected claw-free graphs
This page was built for publication: Cycles through particular subgraphs of claw‐free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4857445)
