Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
type: Item
instance of: scholarly article
title: Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
zbMATH Open document ID: 1272.05093
published in: Science China. Mathematics
publication date: 2013-09-20T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 6209875
zbMATH Keywords: Hamiltonian graphs
zbMATH Keywords: forbidden subgraphs
zbMATH Keywords: claw-free graphs
zbMATH Keywords: closure
author: Hou-yuan Lin
author: Zhiquan Hu
MaRDI profile type: Publication
full work available at URL: s11425-013-4631-z
OpenAlex ID: W2271684320
cites work: Q3211339
cites work: Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
cites work: A reduction method to find spanning Eulerian subgraphs
cites work: Q5315023
cites work: Q3918148
cites work: Characterizing forbidden pairs for hamiltonian properties
cites work: Forbidden Subgraphs for Hamiltonicity of 3-Connected Claw-Free Graphs
cites work: Sufficient conditions for a graph to be Hamiltonian
cites work: Forbidden subgraphs and Hamiltonian properties and graphs
cites work: On Eulerian and Hamiltonian Graphs and Line Graphs
cites work: Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
cites work: Four forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
cites work: Every 3‐connected claw‐free Z 8 ‐free graph is Hamiltonian
cites work: Acyclic edge coloring of graphs with large girths
cites work: Claw-free 3-connectedP11-free graphs are hamiltonian
cites work: On a closure concept in claw-free graphs
cites work: Hamilton cycles in 3-connected claw-free and net-free graphs
DOI: 10.1007/S11425-013-4631-Z
Recommended article: Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected
Recommended article: 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected
Recommended article: Q4945895
Recommended article: Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected
Recommended article: A necessary and sufficient condition for connected, locally k-connected k1,3-free graphs to be k-hamiltonian
Recommended article: Q4240683
Recommended article: Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected
Recommended article: Hamiltonian results inK1,3-free graphs
Recommended article: Q4894622
Recommended article: Q4873826
description: scientific article; zbMATH DE number 6209875