Colour Classes for r-Graphs

DOI10.4153/CMB-1972-063-2zbMath0254.05106OpenAlexW2327588389MaRDI QIDQ5668825

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)

Related Items (11)

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

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