Graph properties and hypergraph colourings

DOI10.1016/0012-365X(91)90034-YzbMath0768.05039OpenAlexW2106640877MaRDI QIDQ1184854

Jason I. Brown, Derek Gordon Corneil

Publication date: 28 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90034-y

zbMATH Keywords

hypergraphsDirac's conjecturehypergraph colourings

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items

On the chromatic index of path decompositions ⋮ The existence of uniquely \(-G\) colourable graphs ⋮ The complexity of generalized graph colorings ⋮ Minimum partition of an independence system into independent sets

Cites Work

• On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
• Perfectly contractile graphs
• The size Ramsey number
• A short proof of the existence of highly chromatic hypergraphs without short cycles
• Colour-critical graphs and hypergraphs
• On Sets of Acquaintances and Strangers at any Party
• On generalized graph colorings
• Generalized Ramsey theory for graphs IV, the Ramsey multiplicity of a graph
• On chromatic number of graphs and set-systems
• On chromatic number of finite set-systems
• On Partitioning Planar Graphs
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
• An Application of Ramsay's Theorem to a Problem of Erdos and Hajnal
• Colour Classes for r-Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graph properties and hypergraph colourings