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

DOI10.7151/DMGT.2113MaRDI QIDQ2312072zbMATH OpenOpenAlexWikidataFDO

Authors Shipeng Wang, Liming Xiong

Publication date 4 July 2019

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

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

zbMATH Keywords

closureindependence numbermatching numbertraceabilitytrail

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5079858
• scientific article; zbMATH DE number 1208720
• scientific article; zbMATH DE number 5938875
• On sufficient degree conditions for traceability of claw-free graphs
• Chvátal–Erdős Theorem: Old Theorem with New Aspects

Cites work

• A note on Hamiltonian circuits
• Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs
• Claw-free graphs---a survey
• Closure and stable Hamiltonian properties in claw-free graphs
• Eulerian subgraphs and Hamilton-connected line graphs
• Graph theory
• scientific article; zbMATH DE number 6119667 (Why is no real title available?)
• On a closure concept in claw-free graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Supereulerian graphs with small matching number and 2-connected Hamiltonian claw-free graphs

Cited in

(5)

• Independence and upper irredundance in claw-free graphs
• The independence number of connected (claw, K₄)-free 4-regular graphs
• scientific article; zbMATH DE number 5671263 (Why is no real title available?)
• scientific article; zbMATH DE number 1463404 (Why is no real title available?)
• On traceability and 2-factors in claw-free graphs

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

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