Some properties of non-bicolorable hypergraphs and the four-color problem

DOI10.1016/0166-218X(95)00028-PzbMath0851.05080OpenAlexW2047135167MaRDI QIDQ1917261

No author found.

Publication date: 21 November 1996

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

Full work available at URL: https://doi.org/10.1016/0166-218x(95)00028-p

zbMATH Keywords

chromatic numbervertex-criticalfour-colour theoremedge-criticalbicolorable hypergraphs

Mathematics Subject Classification ID

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

Related Items (1)

On an adjacency property of almost all tournaments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Une classe d'hypergraphes bichromatiques. II
• On 3-chromatic hypergraphs
• Optimisation and hypergraph theory
• The \(B_r\) property and chromatic numbers of generalized graphs
• ON THE TWO-COLOURING OF HYPERGRAPHS
• Hypergraphs and Ramseyian Theorems
• On a combinatorial game

This page was built for publication: Some properties of non-bicolorable hypergraphs and the four-color problem