The property of k-colourable graphs is uniquely decomposable

DOI10.1016/J.DISC.2012.10.009zbMATH Open1277.05057OpenAlexW2050889929MaRDI QIDQ383763FDOQ383763

Authors: Izak Broere, Michael J. Dorfling 

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

Recommendations

• The decomposability of additive hereditary properties of graphs
• scientific article; zbMATH DE number 4010565
• Uniquely partitionable graphs
• On the completeness of decomposable properties of graphs
• scientific article; zbMATH DE number 1341916

zbMATH Keywords

graph propertydecomposable property

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Graph theory
• Graphs \& digraphs
• Title not available (Why is that?)
• The decomposability of additive hereditary properties of graphs
• A survey of hereditary properties of graphs
• Additive and hereditary properties of graphs are uniquely factorizable into irreducible factors
• Simple proof of the existence of restricted Ramsey graphs by means of a partite construction
• Unique factorization theorem

This page was built for publication: The property of \(k\)-colourable graphs is uniquely decomposable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q383763)