Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs
From MaRDI portal
Publication:400359
DOI10.1016/j.disc.2014.05.019zbMath1298.05251OpenAlexW2260955432MaRDI QIDQ400359
Dingguo Wang, Erfang Shan, Li-ying 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
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)
Related Items (4)
Graphs \(G\) in which \(G-N[v\) has a prescribed property for each vertex \(v\)] ⋮ On line graphs of subcubic 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
Cites Work
- Independence in graphs with maximum degree four
- On the maximum number of independent edges in cubic graphs
- On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs
- Finding independent sets in \(K_4\)-free 4-regular connected graphs
- 11/30 (Finding large independent sets in connected triangle-free 3- regular graphs)
- The independence number of connected (claw, \(K_4\))-free 4-regular graphs
- Independent sets in triangle-free cubic planar graphs
- Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
- On the Independence Number of Graphs with Maximum Degree 3
- Some Ramsey-Type Numbers and the Independence Ratio
- Finding Independent Sets in Triangle-Free Graphs
- A new proof of the independence ratio of triangle-free cubic graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs
