The chromatic reduction problem

DOI10.1002/NET.3230030407zbMATH Open0335.05104OpenAlexW2168180506MaRDI QIDQ4101845FDOQ4101845

Author name not available (Why is that?)

Publication date: 1973

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230030407

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (3)

• Heuristic procedures for the m-partial cover problem on a plane
• Distributed algorithms for maximum cliques
• Preventing redundant solutions in partial enumeration algorithms

This page was built for publication: The chromatic reduction problem

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