On the clique-transversal number of chordal graphs
From MaRDI portal
(Redirected from Publication:1584423)
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 42695 (Why is no real title available?)
- A smallest-fibre-size to poset-size ratio approaching \({8 \over 15}\)
- Chains, antichains, and fibres
- Clique-transversal sets of line graphs and complements of line graphs
- Covering all cliques of a graph
- Covering the cliques of a graph with vertices
- Fibres and ordered set coloring
- Graph theory
- On covering all cliques of a chordal graph
- Some remarks on interval graphs
- Two-colouring all two-element maximal antichains
Cited in
(23)- On the number of edges in the transitive closure of a graph
- Bounds on the clique-transversal number of regular graphs
- The \(\langle t \rangle \)-property of some classes of graphs
- Clique-transversal sets and clique-coloring in planar graphs
- Clique roots of \(K_4\)-free chordal graphs
- The signed maximum-clique transversal number of regular graphs
- A generalization of chordal graphs and the maximum clique problem
- On \(P_4\)-transversals of chordal graphs
- The algorithmic complexity of the minus clique-transversal problem
- Weighted maximum-clique transversal sets of graphs
- Signed and minus clique-transversal functions on graphs
- Clique-transversal number of graphs whose clique-graphs are trees
- Distance-hereditary graphs are clique-perfect
- Hitting all maximal independent sets of a bipartite graph
- Optimal‐size clique transversals in chordal graphs
- Variations of maximum-clique transversal sets on graphs
- scientific article; zbMATH DE number 6612570 (Why is no real title available?)
- scientific article; zbMATH DE number 45166 (Why is no real title available?)
- Transversals of longest cycles in chordal and bounded tree-width graphs
- Signed clique-transversal functions in graphs
- Claw-free cubic graphs with clique-transversal number half of their order
- The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph
- On the clique-transversal number in \({(\mathrm{claw},K_4)}\)-free 4-regular graphs
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)
