Le nombre minimal de colorations d'un hypergraphe k-chromatique

DOI10.1016/0012-365X(79)90021-9zbMath0402.05044MaRDI QIDQ1255502

Ioan Tomescu

Publication date: 1979

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

zbMATH Keywords

Chromatic NumberColouring of a HypergraphMinimal Number of Colourings

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets

Cites Work

• Unnamed Item
• Unnamed Item
• On chromatic number of graphs and set-systems
• On the theory of graphs

This page was built for publication: Le nombre minimal de colorations d'un hypergraphe k-chromatique