The property of \(k\)-colourable graphs is uniquely decomposable
From MaRDI portal
Publication:383763
DOI10.1016/j.disc.2012.10.009zbMath1277.05057OpenAlexW2050889929MaRDI QIDQ383763
Michael J. Dorfling, Izak Broere
Publication date: 6 December 2013
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.10.009
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simple proof of the existence of restricted Ramsey graphs by means of a partite construction
- The decomposability of additive hereditary properties of graphs
- A survey of hereditary properties of graphs
- Unique factorization theorem
- Additive and hereditary properties of graphs are uniquely factorizable into irreducible factors
This page was built for publication: The property of \(k\)-colourable graphs is uniquely decomposable
