On the independence number of traceable 2-connected claw-free graphs

DOI10.7151/dmgt.2113zbMath1415.05141OpenAlexW2805593026WikidataQ129702037 ScholiaQ129702037MaRDI QIDQ2312072

Shipeng Wang, Limning Xiong

Publication date: 4 July 2019

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2113

zbMATH Keywords

independence numbermatching numbertraceabilityclosuretrail

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs
• Claw-free graphs---a survey
• On a closure concept in claw-free graphs
• Eulerian subgraphs and Hamilton-connected line graphs
• A note on Hamiltonian circuits
• Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs
• Closure and stable Hamiltonian properties in claw-free graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs

This page was built for publication: On the independence number of traceable 2-connected claw-free graphs