On the clique-transversal number in (claw,K₄)-free 4-regular graphs
From MaRDI portal
Publication:2452398
Recommendations
- Clique-transversal sets in 4-regular claw-free graphs
- The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph
- Bounds on the clique-transversal number of regular graphs
- The bound of clique-transversal numbers in claw-free graphs
- Claw-free cubic graphs with clique-transversal number half of their order
Cites work
- Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
- Bounds on the clique-transversal number of regular graphs
- Clique-transversal sets and weak 2-colorings in graphs of small maximum degree
- Clique-transversal sets in 4-regular claw-free graphs
- Clique-Transversal Sets in Cubic Graphs
- Clique-transversal sets of line graphs and complements of line graphs
- Covering all cliques of a graph
- Covering the cliques of a graph with vertices
- Finding independent sets in \(K_4\)-free 4-regular connected graphs
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- On covering all cliques of a chordal graph
- On the clique-transversal number of chordal graphs
Cited in
(7)- The independence number of connected (claw, K₄)-free 4-regular graphs
- The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph
- Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs
- The clique-transversal set problem in claw-free graphs with degree at most 4
- The signed maximum-clique transversal number of regular graphs
- Clique-transversal sets in 4-regular claw-free graphs
- Bounds on the clique-transversal number of regular graphs
This page was built for publication: On the clique-transversal number in \({(\mathrm{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 Q2452398)