On a graph colouring problem

DOI10.1016/S0012-365X(98)00060-0zbMath0934.05055MaRDI QIDQ1297488

Maurice Cochand, Gyula Károlyi

Publication date: 10 April 2000

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

zbMATH Keywords

edge-colouringuniform hypergraphsvertex-colouring

Mathematics Subject Classification ID

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

Related Items (7)

A lower bound for the chromatic capacity in terms of the chromatic number of a graph ⋮ Adapted game colouring of graphs ⋮ The Adaptable Chromatic Number and the Chromatic Number ⋮ Chromatic capacities of graphs and hypergraphs ⋮ Adapted list coloring of planar graphs ⋮ Adaptable chromatic number of graph products ⋮ Adaptable choosability of planar graphs with sparse short cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ramsey properties of orientations of graphs
• A Ramsey-Type Theorem for Orderings of a Graph
• The Difference Between Consecutive Primes

This page was built for publication: On a graph colouring problem