Clique-Transversal Sets in Cubic Graphs
From MaRDI portal
Publication:3611901
DOI10.1007/978-3-540-74450-4_10zbMath1176.05059OpenAlexW1562342442MaRDI QIDQ3611901
Erfang Shan, Cheng, T. C. Edwin, Zuosong Liang
Publication date: 3 March 2009
Published in: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74450-4_10
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (4)
Clique-transversal number of graphs whose clique-graphs are trees ⋮ Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs ⋮ On the clique-transversal number in \({(\mathrm{claw},K_4)}\)-free 4-regular graphs ⋮ Bounds on the clique-transversal number of regular graphs
This page was built for publication: Clique-Transversal Sets in Cubic Graphs