Claw-free cubic graphs with clique-transversal number half of their order
From MaRDI portal
Publication:533447
DOI10.1016/j.aml.2011.01.026zbMath1223.05133MaRDI QIDQ533447
Publication date: 3 May 2011
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2011.01.026
05C35: Extremal problems in graph theory
Cites Work
- Unnamed Item
- Unnamed Item
- Clique-transversal sets of line graphs and complements of line graphs
- Bounds on the clique-transversal number of regular graphs
- The \(\langle t \rangle \)-property of some classes of graphs
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
- Covering all cliques of a graph
- Covering the cliques of a graph with vertices
- On the clique-transversal number of chordal graphs
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
- Coloring the Maximal Cliques of Graphs