Note on coloring of double disk graphs

DOI10.1007/s10898-014-0221-zzbMath1309.90117OpenAlexW2081665624MaRDI QIDQ475816

Borut Lužar, Martina Mockovčiaková, Jaka Kranjc, Roman Soták

Publication date: 27 November 2014

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-014-0221-z

zbMATH Keywords

chromatic numberfrequency assignment problemdisk graphdouble disk graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Coloring of graphs and hypergraphs (05C15)

Uses Software

• CALMA

Cites Work

• Unnamed Item
• Local algorithms for edge colorings in UDGs
• On distance constrained labeling of disk graphs
• Conflict-free coloring of unit disks
• Unit disk graphs
• On coloring unit disk graphs
• Coloring of double disk graphs
• A tight bound for online colouring of disk graphs
• Improper colouring of (random) unit disk graphs
• Improper coloring of unit disk graphs
• Smallest-last ordering and clustering and graph coloring algorithms
• Simple heuristics for unit disk graphs
• k-Degenerate Graphs
• Approximation and Online Algorithms
• Models and solution techniques for frequency assignment problems

This page was built for publication: Note on coloring of double disk graphs