Independent sets in \claw, K₄ \-free 4-regular graphs
DOI10.1016/J.DISC.2014.05.019zbMATH Open1298.05251OpenAlexW2260955432MaRDI QIDQ400359FDOQ400359
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
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
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)
Cites Work
- Graph theory
- On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs
- Title not available (Why is that?)
- Finding Independent Sets in Triangle-Free Graphs
- Title not available (Why is that?)
- Independent sets in triangle-free cubic planar graphs
- Title not available (Why is that?)
- Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
- Finding independent sets in \(K_4\)-free 4-regular connected graphs
- 11/30 (Finding large independent sets in connected triangle-free 3- regular graphs)
- On the maximum number of independent edges in cubic graphs
- The independence number of connected (claw, \(K_4\))-free 4-regular graphs
- On the Independence Number of Graphs with Maximum Degree 3
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some Ramsey-Type Numbers and the Independence Ratio
- Title not available (Why is that?)
- A new proof of the independence ratio of triangle-free cubic graphs
- Independence in graphs with maximum degree four
Cited In (11)
- Clique-transversal sets in 4-regular claw-free graphs
- Graphs \(G\) where \(G-N[v]\) is a regular graph for each vertex \(v\)
- Graphs \(G\) where \(G-N[v]\) is a tree for each vertex \(v\)
- The independence number of connected (claw, \(K_4\))-free 4-regular graphs
- On line graphs of subcubic triangle-free graphs
- Graphs \(G\) in which \(G-N[v]\) has a prescribed property for each vertex \(v\)
- Independent sets in \((P_4+P_4\),triangle)-free graphs
- Paired-domination number of claw-free odd-regular graphs
- 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
- A revision and extension of results on 4-regular, 4-connected, 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)
