Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected
type: Item
instance of: scholarly article
title: Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected
zbMATH Open document ID: 1469.05100
author: Zdeněk Ryjáček
author: Petr Vrána
published in: Discrete Mathematics
publication date: 2021-04-28T00:00:00Z
review text: Let \(Z_i\) be the graph obtained by attaching an endvertex of a path of length \(i\) to a vertex of a triangle for a positive integer \(i\). The authors prove that every 3-connected \(K_{1,3}\), \(Z_7\)-free graph is Hamilton-connected, with one exceptional graph.
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 7340577
zbMATH Keywords: Hamilton-connected
zbMATH Keywords: closure
zbMATH Keywords: forbidden subgraph
zbMATH Keywords: claw-free
zbMATH Keywords: \(Z_i\)-free
MaRDI profile type: Publication
full work available at URL: j.disc.2021.112350
OpenAlex ID: W3132075697
cites work: Q4014621
cites work: Q3834074
cites work: Cycles containing 12 vertices in 3-connected cubic graphs
cites work: 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected
cites work: Q5422499
cites work: Closure and stable Hamiltonian properties in claw-free graphs
cites work: Forbidden subgraphs that imply hamiltonian‐connectedness*
cites work: Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
cites work: On Eulerian and Hamiltonian Graphs and Line Graphs
cites work: A nine point theorem for 3-connected graphs
cites work: Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
cites work: Eulerian subgraphs and Hamilton-connected line graphs
cites work: Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs
cites work: Stability of hereditary graph classes under closure operations
cites work: On a closure concept in claw-free graphs
cites work: Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
cites work: A Closure for 1‐Hamilton‐Connectedness in Claw‐Free Graphs
cites work: An analogue of the Whithey theorem for edge graphs of multigraphs, and edge multigraphs
DOI: 10.1016/J.DISC.2021.112350
description: scientific article; zbMATH DE number 7340577