Open packing number for some classes of perfect graphs
From MaRDI portal
Recommendations
Cites work
- Classes of perfect graphs
- Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
- scientific article; zbMATH DE number 2131198 (Why is no real title available?)
- scientific article; zbMATH DE number 3159208 (Why is no real title available?)
- scientific article; zbMATH DE number 1286740 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- Normal hypergraphs and the perfect graph conjecture
- On a property of the class of n-colorable graphs
- On the packing numbers in graphs
- Packing parameters in graphs
- Relations between packing and covering numbers of a tree
- Sur le coloriage des graphs
- The \(\langle t \rangle \)-property of some classes of graphs
- The Private Neighbor Cube
- The strong perfect graph theorem
Cited in
(6)
This page was built for publication: Open packing number for some classes of perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4986289)