On 3-stable number conditions in \(n\)-connected claw-free graphs

DOI10.1016/J.DISC.2018.04.017zbMath1392.05064OpenAlexW2809542560MaRDI QIDQ724867

Zheng Yan, Masao Tsugaki

Publication date: 26 July 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2018.04.017

zbMATH Keywords

stable setindependence numberconnectivityHamiltonian cycleclaw-freeK-ended tree

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Cycles in graphs with prescribed stability number and connectivity
• On a closure concept in claw-free graphs
• A note on Hamiltonian circuits
• Independence trees and Hamilton cycles
• Cycles through particular subgraphs of claw‐free graphs

This page was built for publication: On 3-stable number conditions in \(n\)-connected claw-free graphs