On the clique-transversal number of chordal graphs
From MaRDI portal
Publication:1584423
DOI10.1016/S0012-365X(98)00087-9zbMATH Open0955.05058MaRDI QIDQ1584423FDOQ1584423
Authors: Thomas Andreae 
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- Graph theory
- Title not available (Why is that?)
- Covering all cliques of a graph
- Title not available (Why is that?)
- Covering the cliques of a graph with vertices
- On covering all cliques of a chordal graph
- Clique-transversal sets of line graphs and complements of line graphs
- Some remarks on interval graphs
- Chains, antichains, and fibres
- Two-colouring all two-element maximal antichains
- Fibres and ordered set coloring
- A smallest-fibre-size to poset-size ratio approaching \({8 \over 15}\)
Cited In (23)
- Claw-free cubic graphs with clique-transversal number half of their order
- Optimal‐size clique transversals in chordal graphs
- Weighted maximum-clique transversal sets of graphs
- Clique-transversal sets and clique-coloring in planar graphs
- The \(\langle t \rangle \)-property of some classes of graphs
- Signed and minus clique-transversal functions on graphs
- A generalization of chordal graphs and the maximum clique problem
- Clique roots of \(K_4\)-free chordal graphs
- Bounds on the clique-transversal number of regular graphs
- The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph
- The algorithmic complexity of the minus clique-transversal problem
- Variations of maximum-clique transversal sets on graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the clique-transversal number in \({(\mathrm{claw},K_4)}\)-free 4-regular graphs
- Signed clique-transversal functions in graphs
- Clique-transversal number of graphs whose clique-graphs are trees
- Transversals of longest cycles in chordal and bounded tree-width graphs
- Distance-hereditary graphs are clique-perfect
- Hitting all maximal independent sets of a bipartite graph
- On \(P_4\)-transversals of chordal graphs
- The signed maximum-clique transversal number of regular graphs
- On the number of edges in the transitive closure of a graph
This page was built for publication: On the clique-transversal number of chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584423)
