Independent sets in \claw, K₄ \-free 4-regular graphs

DOI10.1016/J.DISC.2014.05.019MaRDI QIDQ400359zbMATH OpenOpenAlexFDO

Authors Dingguo Wang, Erfang Shan, Liying Kang

Publication date 21 August 2014

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

line graphcubic graphindependence numberclaw-free4-regular graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• The independence number of connected (claw, \(K_4\))-free 4-regular graphs
• Finding independent sets in \(K_4\)-free 4-regular connected graphs
• scientific article; zbMATH DE number 3853136
• On the clique-transversal number in \({(\mathrm{claw},K_4)}\)-free 4-regular graphs
• Clique-transversal sets in 4-regular claw-free graphs

Cites work

• scientific article; zbMATH DE number 4164900 (Why is no real title available?)
• scientific article; zbMATH DE number 3664996 (Why is no real title available?)
• scientific article; zbMATH DE number 3675940 (Why is no real title available?)
• scientific article; zbMATH DE number 21730 (Why is no real title available?)
• scientific article; zbMATH DE number 3536160 (Why is no real title available?)
• scientific article; zbMATH DE number 3043302 (Why is no real title available?)
• 11/30 (Finding large independent sets in connected triangle-free 3- regular graphs)
• A new proof of the independence ratio of triangle-free cubic graphs
• Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
• Finding Independent Sets in Triangle-Free Graphs
• Finding independent sets in \(K_4\)-free 4-regular connected graphs
• Graph theory
• Independence in graphs with maximum degree four
• Independent sets in triangle-free cubic planar graphs
• On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs
• On the Independence Number of Graphs with Maximum Degree 3
• On the maximum number of independent edges in cubic graphs
• Some Ramsey-Type Numbers and the Independence Ratio
• The independence number of connected (claw, \(K_4\))-free 4-regular graphs

Cited in

(11)

• Independent sets in \((P_4+P_4\),triangle)-free graphs
• Paired-domination number of claw-free odd-regular graphs
• Graphs \(G\) where \(G-N[v]\) is a tree for each vertex \(v\)
• On line graphs of subcubic triangle-free graphs
• A revision and extension of results on 4-regular, 4-connected, claw-free graphs
• The independence number of connected (claw, \(K_4\))-free 4-regular graphs
• Graphs \(G\) where \(G-N[v]\) is a regular graph for each vertex \(v\)
• Graphs \(G\) in which \(G-N[v]\) has a prescribed property for each vertex \(v\)
• The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph
• Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques
• Clique-transversal sets in 4-regular claw-free graphs

This page was built for publication: Independent sets in \(\{\text{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 Q400359)