On the clique-transversal number in \({(\mathrm{claw},K_4)}\)-free 4-regular graphs

DOI10.1007/s10114-013-2083-6zbMath1288.05199OpenAlexW2460791666MaRDI QIDQ2452398

Zuosong Liang, Erfang Shan, Dingguo Wang

Publication date: 3 June 2014

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-013-2083-6

zbMATH Keywords

graphclaw-free graphclique4-regular graphclique-transversal set

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph

Cites Work

• Unnamed Item
• Unnamed Item
• Clique-transversal sets in 4-regular claw-free graphs
• Clique-transversal sets of line graphs and complements of line graphs
• Bounds on the clique-transversal number of regular 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
• On the clique-transversal number of chordal graphs
• On covering all cliques of a chordal graph
• Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
• Clique-Transversal Sets in Cubic Graphs

This page was built for publication: On the clique-transversal number in \({(\mathrm{claw},K_4)}\)-free 4-regular graphs