3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected
type: Item
instance of: scholarly article
title: 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected
zbMATH Open document ID: 1298.05189
author: Qiuju Bian
author: Ronald Gould
author: Susan Janiszewski
author: Steven La Fleur
author: Paul Wrayno
author: Paul Horn
published in: Graphs and Combinatorics
publication date: 2014-09-19T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 6346036
zbMATH Keywords: Hamilton-connected
zbMATH Keywords: 3-connected
zbMATH Keywords: claw-free
zbMATH Keywords: dominating
zbMATH Keywords: closure
MaRDI profile type: Publication
full work available at URL: s00373-013-1344-6
OpenAlex ID: W2004434341
cites work: Forbidden subgraphs that imply hamiltonian‐connectedness*
cites work: 9-connected claw-free graphs are Hamilton-connected
cites work: Q4350166
cites work: Q4500611
cites work: On Forbidden Pairs Implying Hamilton‐Connectedness
cites work: Characterizing forbidden pairs for hamiltonian properties
cites work: On graph closures
cites work: Hamiltonicity in claw-free graphs
DOI: 10.1007/S00373-013-1344-6
Recommended article: Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
Recommended article: Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected
Recommended article: Q4945895
Recommended article: Q4240683
Recommended article: Hamiltonian results inK1,3-free graphs
Recommended article: A necessary and sufficient condition for connected, locally k-connected k1,3-free graphs to be k-hamiltonian
Recommended article: 9-connected claw-free graphs are Hamilton-connected
Recommended article: Q4873826
Recommended article: A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs
Recommended article: Q3017045
description: scientific article; zbMATH DE number 6346036