Multicoloring of cannonball graphs

DOI10.26493/1855-3974.528.751zbMath1338.05094arXiv1307.2688OpenAlexW1934352736WikidataQ129355136 ScholiaQ129355136MaRDI QIDQ2810379

Rafał Witkowski, Janez Žerovnik, Petra Šparl

Publication date: 1 June 2016

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.2688

zbMATH Keywords

approximation algorithmgraph coloringcellular networksfrequency planning

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (2)

Maximum induced matching of hexagonal graphs ⋮ Coloring of the \(d^{\text{th}}\) power of the face-centered cubic grid

This page was built for publication: Multicoloring of cannonball graphs