Channel assignment with \(r\)-dynamic coloring

DOI10.1007/978-3-030-04618-7_4zbMath1522.05409MaRDI QIDQ6049080

Yuehua Bu, Junlei Zhu

Publication date: 16 October 2023

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

zbMATH Keywords

girthplanar graphmaximum average degree\(r\)-dynamic coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex degrees (05C07)

Related Items (3)

2-distance list \((\Delta +2)\)-coloring of planar graphs with girth at least 10 ⋮ \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\) ⋮ The structure and the list 3-dynamic coloring of outer-1-planar graphs

This page was built for publication: Channel assignment with \(r\)-dynamic coloring