Graph properties and hypergraph colourings

DOI10.1016/0012-365X(91)90034-YMaRDI QIDQ1184854zbMATH OpenOpenAlexFDO

Authors Jason I. Brown, Derek G. 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

Dirac's conjecturehypergraph colouringshypergraphs

Mathematics Subject Classification ID

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

Review text

The paper gives new results in hypergraph chromatic theory via a graphic approach. The authors show that Dirac's conjecture (every vertex \(k\)- critical graph, \(k\geq 2\), has a critical edge) fails for hypergraphs.

Recommendations

• Color-critical graphs and hypergraphs with few edges: a survey
• On the number of edges in colour-critical graphs and hypergraphs
• Coloring directed hypergraphs
• Hypergraphs with high chromatic number
• A note on a conjecture of Dirac

Cites work

• A short proof of the existence of highly chromatic hypergraphs without short cycles
• An Application of Ramsay's Theorem to a Problem of Erdos and Hajnal
• Colour Classes for r-Graphs
• Colour-critical graphs and hypergraphs
• Generalized Ramsey theory for graphs IV, the Ramsey multiplicity of a graph
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
• scientific article; zbMATH DE number 3885934 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3485832 (Why is no real title available?)
• scientific article; zbMATH DE number 3503283 (Why is no real title available?)
• scientific article; zbMATH DE number 3536154 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On chromatic number of finite set-systems
• On chromatic number of graphs and set-systems
• On generalized graph colorings
• On Partitioning Planar Graphs
• On Sets of Acquaintances and Strangers at any Party
• On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
• Perfectly contractile graphs
• The size Ramsey number

Cited in

(8)

• Minimum partition of an independence system into independent sets
• Square critically 3-chromatic hypergraphs
• The existence of uniquely \(-G\) colourable graphs
• On the chromatic index of path decompositions
• The complexity of generalized graph colorings
• scientific article; zbMATH DE number 637278 (Why is no real title available?)
• scientific article; zbMATH DE number 6786475 (Why is no real title available?)
• Coloring directed hypergraphs

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

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