Multicoloring unit disk graphs on triangular lattice points

MaRDI QIDQ2921755zbMATH OpenFDO

Authors Yuichiro Miyamoto, Tomomi Matsui

Publication date 13 October 2014

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Approximation algorithms (68W25)

Recommendations

• Perfectness and imperfectness of unit disk graphs on triangular lattice points
• LINEAR TIME APPROXIMATION ALGORITHM FOR MULTICOLORING LATTICE GRAPHS WITH DIAGONALS
• Algorithmic Applications in Management
• Approximation algorithms for multicoloring planar graphs and powers of square and triangular meshes
• On coloring unit disk graphs

Cited in

(4)

• Perfectness and imperfectness of unit disk graphs on triangular lattice points
• Local 7-coloring for planar subgraphs of unit disk graphs
• LINEAR TIME APPROXIMATION ALGORITHM FOR MULTICOLORING LATTICE GRAPHS WITH DIAGONALS
• Approximation algorithms for multicoloring planar graphs and powers of square and triangular meshes

This page was built for publication: Multicoloring unit disk graphs on triangular lattice points

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