On Colorings of Squares of Outerplanar Graphs
From MaRDI portal
Publication:5501265
zbMath1318.05022arXiv0706.1526MaRDI QIDQ5501265
Geir Agnarsson, Magnús M. Halldórsson
Publication date: 3 August 2015
Full work available at URL: https://arxiv.org/abs/0706.1526
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (7)
Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies ⋮ Conservative trees ⋮ Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs ⋮ Strongly simplicial vertices of powers of trees ⋮ Spanning tree congestion of \(k\)-outerplanar graphs ⋮ \(L(h,1,1)\)-labeling of outerplanar graphs ⋮ Linear-time algorithms for tree root problems
This page was built for publication: On Colorings of Squares of Outerplanar Graphs
