On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs
From MaRDI portal
Publication:2214314
DOI10.7151/dmgt.2170zbMath1453.05058OpenAlexW2898344779WikidataQ129049804 ScholiaQ129049804MaRDI QIDQ2214314
Wojciech Wideł, Li-Gong Wang, Wei Zheng
Publication date: 8 December 2020
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2170
Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs
- Hamilton cycles in implicit claw-heavy graphs
- Implicit degree condition for Hamiltonicity of 2-heavy graphs
- Degree conditions restricted to induced paths for Hamiltonicity of claw-heavy graphs
- New sufficient conditions for cycles in graphs
- Implicit-degrees and circumferences
- Degree conditions on induced claws
- An implicit degree condition for long cycles in 2-connected graphs
- Forbidden subgraphs and Hamiltonian properties and graphs
- A generalization of Fan's condition and forbidden subgraph conditions for hamiltonicity
- Dirac's minimum degree condition restricted to claws
- Characterizing forbidden pairs for hamiltonian properties
- Forbidden triples for Hamiltonicity
- A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness
- Sufficient conditions for a graph to be Hamiltonian
- Heavy subgraphs, stability and Hamiltonicity
- Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity
- A note on Hamiltonian circuits
- Fan-type implicit-heavy subgraphs for Hamiltonicity of implicit claw-heavy graphs
- Hamilton cycles in implicit 2-heavy graphs
- Forbidden Pairs of Disconnected Graphs Implying Hamiltonicity
- An Implicit Degree Condition for Cyclability in Graphs
- Note on Hamilton Circuits
- Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs
- Degree-light-free graphs and Hamiltonian cycles
This page was built for publication: On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs
