The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph
From MaRDI portal
Publication:2339429
DOI10.1016/j.disc.2015.01.039zbMath1309.05142OpenAlexW1997809309MaRDI QIDQ2339429
Qinqin Li, Fenling Xu, Baoyindureng Wu
Publication date: 1 April 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2015.01.039
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
Graphs \(G\) in which \(G-N[v\) has a prescribed property for each vertex \(v\)]
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs
- Independent sets and matchings in subcubic graphs
- Clique-transversal sets in 4-regular claw-free graphs
- Bounds on the clique-transversal number of regular graphs
- Covering all cliques of a graph
- Covering the cliques of a graph with vertices
- On the clique-transversal number of chordal graphs
- Tight bounds on maximal and maximum matchings
- On covering all cliques of a chordal graph
- On the clique-transversal number in \({(\mathrm{claw},K_4)}\)-free 4-regular graphs
- Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
- Path factors in cubic graphs
- Characterizations of derived graphs
This page was built for publication: The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph
