Forbidden pairs for \(k\)-connected Hamiltonian graphs
type: Item
instance of: scholarly article
title: Forbidden pairs for \(k\)-connected Hamiltonian graphs
zbMATH Open document ID: 1237.05119
author: Guantao Chen
author: Yoshimi Egawa
author: Ronald Gould
author: Akira Saito
published in: Discrete Mathematics
publication date: 2012-03-16T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 6015210
zbMATH Keywords: Hamiltonian cycle
zbMATH Keywords: forbidden subgraphs
zbMATH Keywords: pancyclic graphs
zbMATH Keywords: Hamiltonian-connectedness
zbMATH Keywords: stars
zbMATH Keywords: claws
MaRDI profile type: Publication
full work available at URL: j.disc.2011.10.019
OpenAlex ID: W1990623720
cites work: Pancyclic graphs. I
cites work: Forbidden subgraphs that imply hamiltonian‐connectedness*
cites work: On factors of 4-connected claw-free graphs
cites work: Forbidden triples for Hamiltonicity
cites work: Q4500611
cites work: A note on Hamiltonian circuits
cites work: Q3509400
cites work: Q4393234
cites work: Forbidden subgraphs that imply 2-factors
cites work: Characterizing forbidden pairs for hamiltonian properties
cites work: Forbidden triples implying Hamiltonicity: for all graphs
cites work: Potential forbidden triples implying hamiltonicity: for sufficiently large graphs
cites work: Characterizing forbidden clawless triples implying Hamiltonian graphs
cites work: A pair of forbidden subgraphs and perfect matchings.
cites work: Q3880849
cites work: Hamiltonian results inK1,3-free graphs
cites work: Hamiltonicity and forbidden subgraphs in 4‐connected graphs
cites work: Forbidden subgraphs and bounds on the size of a maximum matching
cites work: On a closure concept in claw-free graphs
cites work: Q4869540
DOI: 10.1016/J.DISC.2011.10.019
description: scientific article; zbMATH DE number 6015210