The t -property of some classes of graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5158490 (Why is no real title available?)
- A Linear Recognition Algorithm for Cographs
- Algorithmic aspects of clique-transversal and clique-independent sets
- Algorithmic graph theory and perfect graphs
- Covering all cliques of a graph
- Covering the cliques of a graph with vertices
- On clique-transversals and clique-independent sets
- On the clique-transversal number of chordal graphs
- The Private Neighbor Cube
- The strong perfect graph theorem
Cited in
(8)- Open packing number for some classes of perfect graphs
- Clique-transversal sets and clique-coloring in planar graphs
- scientific article; zbMATH DE number 734478 (Why is no real title available?)
- Linear time algorithm for dominator chromatic number of trestled graphs
- scientific article; zbMATH DE number 4132197 (Why is no real title available?)
- scientific article; zbMATH DE number 7316311 (Why is no real title available?)
- scientific article; zbMATH DE number 7310226 (Why is no real title available?)
- Claw-free cubic graphs with clique-transversal number half of their order
This page was built for publication: The \(\langle t \rangle \)-property of some classes of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998518)