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

DOI10.1016/J.DISC.2018.04.017MaRDI QIDQ724867zbMATH OpenOpenAlexFDO

Authors 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

Hamiltonian cycleconnectivityindependence numberstable setclaw-freeK-ended tree

Mathematics Subject Classification ID

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

Recommendations

• The stable set polytope of claw-free graphs with stability number greater than three
• On the connectivity and matchings in 3-vertex-critical claw-free graphs
• On facets of stable set polytopes of claw-free graphs with stability number 3
• On facets of stable set polytopes of claw-free graphs with stability number three
• \(Z_3\)-connectivity of claw-free graphs
• On Hamiltonicity of 3-connected claw-free graphs
• On the stability number of claw-free \(P_5\)-free and more general graphs
• Critical graphs for subpancyclicity of 3-connected claw-free graphs
• Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
• Claw-freeness, 3-homogeneous subsets of a graph and a reconstruction problem

Cites work

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

Cited in

(1)

• On facets of stable set polytopes of claw-free graphs with stability number 3

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724867)