On the clique-transversal number of chordal graphs
From MaRDI portal
Publication:1584423
DOI10.1016/S0012-365X(98)00087-9zbMath0955.05058MaRDI QIDQ1584423
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
The algorithmic complexity of the minus clique-transversal problem ⋮ Clique-transversal number of graphs whose clique-graphs are trees ⋮ 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 ⋮ Bounds on the clique-transversal number of regular graphs ⋮ The signed maximum-clique transversal number of regular graphs ⋮ Claw-free cubic graphs with clique-transversal number half of their order ⋮ Distance-hereditary graphs are clique-perfect ⋮ Signed and minus clique-transversal functions on graphs ⋮ Signed clique-transversal functions in graphs ⋮ The \(\langle t \rangle \)-property of some classes of graphs ⋮ The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph ⋮ Hitting all maximal independent sets of a bipartite graph
Cites Work
- Clique-transversal sets of line graphs and complements of line graphs
- Some remarks on interval 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
- On covering all cliques of a chordal graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
