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)
05C35: Extremal problems in graph theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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