Clique-Transversal Sets in Cubic Graphs
From MaRDI portal
Publication:3611901
Recommendations
- Clique-transversal sets in line graphs of cubic graphs and triangle-free graphs
- Clique-transversal number in cubic graphs
- Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs
- Clique-transversal sets and clique-coloring in planar graphs
- Clique-transversal sets of line graphs and complements of line graphs
- On cubic non-Cayley vertex-transitive graphs
- Cubic vertex-transitive graphs on up to 1280 vertices
- On clique-transversals and clique-independent sets
- Clique-transversal sets in 4-regular claw-free graphs
- Variations of maximum-clique transversal sets on graphs
Cited in
(13)- Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs
- Clique-transversal sets in 4-regular claw-free graphs
- Weighted maximum-clique transversal sets of graphs
- Clique-transversal sets and clique-coloring in planar graphs
- On the clique-transversal number of chordal graphs
- Bounds on the clique-transversal number of regular graphs
- The bound of clique-transversal numbers in claw-free graphs
- Clique-transversal number in cubic graphs
- Bounds on some parameters in triangle-free cubic graphs
- On the clique-transversal number in \({(\mathrm{claw},K_4)}\)-free 4-regular graphs
- Clique-transversal number of graphs whose clique-graphs are trees
- 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
This page was built for publication: Clique-Transversal Sets in Cubic Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611901)