OPEN PACKING NUMBER FOR SOME CLASSES OF PERFECT GRAPHS
From MaRDI portal
Publication:4986289
DOI10.15826/umj.2020.2.004zbMath1462.05154OpenAlexW3114408349MaRDI QIDQ4986289
No author found.
Publication date: 27 April 2021
Published in: Ural Mathematical Journal (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/umj124
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Perfect graphs (05C17)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The strong perfect graph theorem
- The \(\langle t \rangle \)-property of some classes of graphs
- Relations between packing and covering numbers of a tree
- Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
- Packing parameters in graphs
- Classes of perfect graphs
- Normal hypergraphs and the perfect graph conjecture
- On a property of the class of n-colorable graphs
- The Private Neighbor Cube
- On the packing numbers in graphs
- Sur le coloriage des graphs
This page was built for publication: OPEN PACKING NUMBER FOR SOME CLASSES OF PERFECT GRAPHS