Colour Classes for r-Graphs

DOI10.4153/CMB-1972-063-2MaRDI QIDQ5668825zbMATH OpenOpenAlexFDO

Authors E. J. Cockayne

Publication date 1972

Published in Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/cmb-1972-063-2

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited in

(11)

• Graph properties and hypergraph colourings
• The existence of uniquely \(-G\) colourable graphs
• The subchromatic number of a graph
• Minimal reducible bounds for induced-hereditary properties
• The complexity of generalized graph colorings
• Generalized hypergraph coloring
• Unique factorization of compositive hereditary graph properties
• On generalized graph colorings
• A Canonical Ramsey Theorem
• ON UNIQUELY -G k-COLOURABLE GRAPHS
• Additive and hereditary properties of graphs are uniquely factorizable into irreducible factors

This page was built for publication: Colour Classes for r-Graphs

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