On covering all cliques of a chordal graph
From MaRDI portal
Publication:1910588
DOI10.1016/0012-365X(94)00276-OzbMath0846.05050MaRDI QIDQ1910588
Carsten Flotow, Thomas Andreae
Publication date: 26 March 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (11)
The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs ⋮ Weighted maximum-clique transversal sets of graphs ⋮ Variations of maximum-clique transversal sets on graphs ⋮ Clique-transversal sets and clique-coloring in planar graphs ⋮ On the clique-transversal number in \({(\mathrm{claw},K_4)}\)-free 4-regular graphs ⋮ The clique-transversal set problem in claw-free graphs with degree at most 4 ⋮ The signed maximum-clique transversal number of regular graphs ⋮ Distance-hereditary graphs are clique-perfect ⋮ Signed and minus clique-transversal functions on graphs ⋮ On the clique-transversal number of chordal graphs ⋮ The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph
Cites Work
- Clique-transversal sets of line graphs and complements of line graphs
- Chains, antichains, and fibres
- Covering all cliques of a graph
- Two-colouring all two-element maximal antichains
- Fibres and ordered set coloring
- A smallest-fibre-size to poset-size ratio approaching \({8 \over 15}\)
- Covering the cliques of a graph with vertices
This page was built for publication: On covering all cliques of a chordal graph
