On a graph colouring problem

DOI10.1016/S0012-365X(98)00060-0MaRDI QIDQ1297488zbMATH OpenFDO

Authors Maurice Cochand, Gyula Károlyi

Publication date 10 April 2000

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

uniform hypergraphsedge-colouringvertex-colouring

Mathematics Subject Classification ID

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

Recommendations

• Chromatic capacity and graph operations
• A NOTE ON COLOURING OF COMPLETE GRAPHS
• Edge coloring complete uniform hypergraphs with many components
• scientific article; zbMATH DE number 1506501

Cites work

• scientific article; zbMATH DE number 4144029 (Why is no real title available?)
• scientific article; zbMATH DE number 53883 (Why is no real title available?)
• scientific article; zbMATH DE number 3492718 (Why is no real title available?)
• A Ramsey-Type Theorem for Orderings of a Graph
• Ramsey properties of orientations of graphs
• The Difference Between Consecutive Primes

Cited in

(12)

• Adapted list coloring of planar graphs
• Adapted game colouring of graphs
• The Adaptable Chromatic Number and the Chromatic Number
• Chromatic capacities of graphs and hypergraphs
• Colored problems in graphs
• scientific article; zbMATH DE number 411546 (Why is no real title available?)
• 25 pretty graph colouring problems
• Adaptable chromatic number of graph products
• Chromatic capacity and graph operations
• On solving the queen graph coloring problem
• Adaptable choosability of planar graphs with sparse short cycles
• A lower bound for the chromatic capacity in terms of the chromatic number of a graph

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

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