Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs
type: Item
instance of: scholarly article
title: Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs
zbMATH Open document ID: 1402.05130
author: Zdeněk Ryjáček
author: Petr Vrána
author: Shipeng Wang
published in: Journal of Combinatorial Theory. Series B
publication date: 2018-12-20T00:00:00Z
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 6996346
zbMATH Keywords: Hamiltonian graph
zbMATH Keywords: closure
zbMATH Keywords: \(\{K_{1
zbMATH Keywords: 4}
zbMATH Keywords: K_{1
zbMATH Keywords: 4} + e \}\)-free graph
zbMATH Keywords: claw-free graph
zbMATH Keywords: line graph
zbMATH Keywords: Thomassen's conjecture
zbMATH Keywords: degree condition
MaRDI profile type: Publication
full work available at URL: j.jctb.2018.06.006
OpenAlex ID: W2883400171
cites work: Hamiltonian properties of graphs with large neighborhood unions
cites work: Q5422499
cites work: Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
cites work: How many conjectures can you stand? A survey
cites work: A Relationship Between Thomassen's Conjecture and Bondy's Conjecture
cites work: Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
cites work: Q4873826
cites work: Clique covering and degree conditions for Hamiltonicity in claw-free graphs
cites work: Q3832607
cites work: On Eulerian and Hamiltonian Graphs and Line Graphs
cites work: Hamilton cycles in 5-connected line graphs
cites work: On 1-Hamilton-connected claw-free graphs
cites work: A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
cites work: Q3491603
cites work: Hamiltonian results inK1,3-free graphs
cites work: Longest paths and cycles in K1,3-free graphs
cites work: On a closure concept in claw-free graphs
cites work: A Closure for 1‐Hamilton‐Connectedness in Claw‐Free Graphs
cites work: Reflections on graph theory
cites work: On hamiltonian line graphs and connectivity
cites work: Hamilton cycles in claw-free graphs
DOI: 10.1016/J.JCTB.2018.06.006
Recommended article: Q4659580
Recommended article: Hamiltonicity of \(\{K_{1,4},K_{1,4}+e\}\)-free graphs
Recommended article: A note on \(K_ 4\)-closures in hamiltonian graph theory
Recommended article: Q3025205
Recommended article: The \(*\)-closure for graphs and claw-free graphs
Recommended article: Characterizations of \((4 K_1,C_4,C_5)\)-free graphs
Recommended article: Cyclability in \(k\)-connected \(K_{1,4}\)-free graphs
Recommended article: \(K_{4}\)-free graphs with no odd holes
Recommended article: Clique roots of K4-free chordal graphs
Recommended article: On the structure and clique‐width of (4K1,C4,C6,C7)‐free graphs
description: scientific article; zbMATH DE number 6996346