Hamilton cycles in almost distance-hereditary graphs
From MaRDI portal
Publication:317825
DOI10.1515/math-2016-0003zbMath1346.05134arXiv1306.5316MaRDI QIDQ317825
Publication date: 4 October 2016
Published in: Open Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.5316
claw-free graph; Hamilton cycle; 1-heavy graph; 2-heavy graph; almost distance-hereditary graph; claw-heavy graph
Cites Work
- Unnamed Item
- Unnamed Item
- Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs
- Cycles through specified vertices
- Hamiltonian problem on claw-free and almost distance-hereditary graphs
- Degree conditions on induced claws
- Hamilton cycles in claw-heavy graphs
- Dirac's minimum degree condition restricted to claws
- Degree conditions on claws and modified claws for Hamiltonicity of graphs
- Computing maximum stable sets for distance-hereditary graphs
- Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs
- Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
- 2‐neighborhoods and hamiltonian conditions
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs
- Reducibility among Combinatorial Problems
- Hamiltonian cycle in almost distance-hereditary graphs with degree condition restricted to claws†
- Almost distance-hereditary graphs