The independence number of connected (claw, K₄)-free 4-regular graphs

DOI10.11650/TJM.17.2013.2895zbMATH Open1262.05119OpenAlexW4251728514MaRDI QIDQ1949035FDOQ1949035

Authors: Dingguo Wang, Erfang Shan, Liying Kang 

Publication date: 25 April 2013

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.twjm/1499705887

Recommendations

• Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs
• A revision and extension of results on 4-regular, 4-connected, claw-free graphs
• On the clique-transversal number in \({(\mathrm{claw},K_4)}\)-free 4-regular graphs
• On the numbers of independent \(k\)-sets in a claw free graph
• Disjoint \(K_{1, 4}\) in claw-free graphs with minimum degree at least four
• Finding independent sets in \(K_4\)-free 4-regular connected graphs
• On the independence number of traceable 2-connected claw-free graphs
• On factors of 4-connected claw-free graphs
• On 4-connected claw-free well-covered graphs
• Disjoint \(K_4^-\) in claw-free graphs with minimum degree at least five

zbMATH Keywords

independent setindependence numberclaw-free4-regular graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (3)

• Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs
• On line graphs of subcubic triangle-free graphs
• Disjoint \(K_4^-\) in claw-free graphs with minimum degree at least five

This page was built for publication: The independence number of connected (claw, \(K_4\))-free 4-regular graphs

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