Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs
From MaRDI portal
Publication:2219958
DOI10.1016/j.disc.2020.112165zbMath1455.05037OpenAlexW3090089823MaRDI QIDQ2219958
Publication date: 21 January 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2020.112165
Related Items (3)
Hamiltonian line graphs with local degree conditions ⋮ Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs. II ⋮ On cycle-nice claw-free graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Induced subgraphs with large degrees at end-vertices for Hamiltonicity of claw-free graphs
- Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
- Graphs without spanning closed trails
- Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
- On dominating and spanning circuits in graphs
- On a closure concept in claw-free graphs
- Characterizing forbidden pairs for hamiltonian properties
- Supereulerian graphs and excluded induced minors
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- Degree conditions on claws and modified claws for Hamiltonicity of graphs
- Longest paths and cycles in K1,3-free graphs
- Contractions and hamiltonian line graphs
- A reduction method to find spanning Eulerian subgraphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
This page was built for publication: Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs