Dominating sets and Hamiltonicity in \(K_{1,3}\)-free graphs

DOI10.1007/BF02104806zbMath0852.05062MaRDI QIDQ1920760

A. A. Ageev

Publication date: 25 November 1996

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

cubic graphsHamiltonicitydominating cyclesHamiltonian cycle problemThomassen's conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45)

Related Items

Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected, Conditions on subgraphs, degrees, and domination for Hamiltonian properties of graphs, A characterization of triangular and lattice graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On maximal independent sets of vertices in claw-free graphs
• Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
• A generalization of Dirac's theorem for \(K(1,3)\)-free graphs
• Hamiltonian results inK1,3-free graphs
• Longest paths and cycles in K1,3-free graphs
• Hamilton cycles in claw-free graphs
• Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
• Updating the hamiltonian problem—A survey
• The Planar Hamiltonian Circuit Problem is NP-Complete