2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices
From MaRDI portal
Publication:2282467
DOI10.7151/DMGT.2125zbMATH Open1439.05131OpenAlexW2811448670WikidataQ129587911 ScholiaQ129587911MaRDI QIDQ2282467FDOQ2282467
Authors: Tao Tian, Liming Xiong 
Publication date: 8 January 2020
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2125
Recommendations
- Nonhamiltonian 2-connected claw-free graphs with large 4-degree sum
- Hamiltonian cycles in \(2\)-connected claw-free graphs
- A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
- The Hamilton-connectivity with the degree sum of non-adjacent subgraphs of claw-free graphs
- Hamiltonicity and degrees of adjacent vertices in claw-free graphs
Cites Work
- Graph theory
- Graphs without spanning closed trails
- On dominating and spanning circuits in graphs
- Claw-free graphs---a survey
- On a closure concept in claw-free graphs
- Note on Hamilton Circuits
- Longest paths and cycles in K1,3-free graphs
- A reduction method to find spanning Eulerian subgraphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
- Hamiltonicity and Degrees of Adjacent Vertices in Claw‐Free Graphs
- New sufficient conditions for cycles in graphs
- Recent advances on the Hamiltonian problem: survey III
- Clique covering and degree conditions for Hamiltonicity in claw-free graphs
- Hamilton cycles in claw-free graphs
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: 2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2282467)
