Bounds on the clique-transversal number of regular graphs
DOI10.1007/S11425-007-0157-6zbMATH Open1168.05046OpenAlexW1942892208MaRDI QIDQ943436FDOQ943436
Authors: Erfang Shan, T. C. Edwin Cheng, Liying Kang 
Publication date: 9 September 2008
Published in: Science in China. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-007-0157-6
Recommendations
- Clique-transversal sets in 4-regular claw-free graphs
- On the clique-transversal number in \({(\mathrm{claw},K_4)}\)-free 4-regular graphs
- Clique-Transversal Sets in Cubic Graphs
- The bound of clique-transversal numbers in claw-free graphs
- Claw-free cubic graphs with clique-transversal number half of their order
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Hypergraphs (05C65) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- Covering all cliques of a graph
- Graph theory with applications
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
- Distance-hereditary graphs are clique-perfect
- Maximum \(h\)-colourable subgraph problem in balanced graphs
- On balanced graphs
- Covering the cliques of a graph with vertices
- On clique-transversals and clique-independent sets
- Algorithmic aspects of clique-transversal and clique-independent sets
- Title not available (Why is that?)
- Algorithmic Aspects of Neighborhood Numbers
- Clique-transversal sets of line graphs and complements of line graphs
- On the clique-transversal number of chordal graphs
- The algorithmic complexity of the minus clique-transversal problem
- Chains, antichains, and fibres
- On clique-perfect and K-perfect graphs
- Clique-Transversal Sets in Cubic Graphs
- Another note on cliques and independent sets
Cited In (17)
- Claw-free cubic graphs with clique-transversal number half of their order
- Clique-transversal sets and clique-coloring in planar graphs
- Sizes and transmissions of digraphs with a given clique number
- The bound of clique-transversal numbers in claw-free graphs
- The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph
- Title not available (Why is that?)
- On the clique-transversal number in \({(\mathrm{claw},K_4)}\)-free 4-regular graphs
- On clique-clique domination number and inverse clique transversal number of a graph
- Signed clique-transversal functions in graphs
- The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs
- Clique-transversal number of graphs whose clique-graphs are trees
- The clique-transversal set problem in claw-free graphs with degree at most 4
- Clique-transversal sets in line graphs of cubic graphs and triangle-free graphs
- The signed maximum-clique transversal number of regular graphs
- The clique numbers of regular graphs of matrix algebras are finite
- On the number of edges in the transitive closure of a graph
- Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs
This page was built for publication: Bounds on the clique-transversal number of regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q943436)
