scientific article; zbMATH DE number 3435543

MaRDI QIDQ4401989zbMATH OpenFDO

Authors Jean-Louis Laurière

Publication date 1974

zbMATH Keywords

algorithmhypergraphsstrong coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Algorithms in computer science (68W99)

Recommendations

• scientific article; zbMATH DE number 44531
• scientific article; zbMATH DE number 25263
• The complexity of some graph colouring problems
• scientific article; zbMATH DE number 1947044
• Plurigraph coloring and scheduling problems
• The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
• Polynomial-time approximation algorithms for the coloring problem in some cases
• Randomized algorithms for colourings of hypergraphs
• The complexity of colouring problems on dense graphs
• Scheduling Problems and Mixed Graph Colorings

Cited in

(1)

• Compactness and balancing in scheduling

This page was built for publication:

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