Claw-free cubic graphs with clique-transversal number half of their order
From MaRDI portal
Publication:533447
DOI10.1016/J.AML.2011.01.026zbMATH Open1223.05133OpenAlexW1999074927MaRDI QIDQ533447FDOQ533447
Authors: Erfang Shan, Haichao Wang 
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
Recommendations
- The bound of clique-transversal numbers in claw-free graphs
- Counting Claw-Free Cubic Graphs
- Clique-transversal number in cubic graphs
- Clique-transversal sets in 4-regular claw-free graphs
- Clique-chromatic numbers of claw-free graphs
- Semipaired domination in claw-free cubic graphs
- Counting labeled claw-free cubic graphs by connectivity
- A characterization of claw-free CIS graphs and new results on the order of CIS graphs
- Cubicity of interval graphs and the claw number
- Cubicity of interval graphs and the claw number
Cites Work
- Covering all cliques of a graph
- Title not available (Why is that?)
- Bounds on the clique-transversal number of regular graphs
- Covering the cliques of a graph with vertices
- Clique-transversal sets and weak 2-colorings in graphs of small maximum degree
- Clique-transversal sets of line graphs and complements of line graphs
- 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
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
- The \(\langle t \rangle \)-property of some classes of graphs
Cited In (11)
- Clique-transversal sets in 4-regular claw-free graphs
- The bound of clique-transversal numbers in claw-free graphs
- Bounds on the clique-transversal number of regular graphs
- Clique-transversal number in cubic graphs
- Bounds on some parameters in triangle-free cubic graphs
- Counting labeled claw-free cubic graphs by connectivity
- The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph
- On the clique-transversal number in \({(\mathrm{claw},K_4)}\)-free 4-regular graphs
- Clique-transversal sets in line graphs of cubic graphs and triangle-free graphs
- Clique-transversal sets and weak 2-colorings in graphs of small maximum degree
- Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs
This page was built for publication: Claw-free cubic graphs with clique-transversal number half of their order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q533447)
