On covering all cliques of a chordal graph
From MaRDI portal
Publication:1910588
DOI10.1016/0012-365X(94)00276-OzbMath0846.05050MaRDI QIDQ1910588
Thomas Andreae, Carsten Flotow
Publication date: 26 March 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
05C35: Extremal problems in graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
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