Coloring Powers of Planar Graphs

This publication has 10 references indexed in Scilit:

• Local structures in plane maps and distance colourings
  Discrete Mathematics, 2001
• Models and Approximation Algorithms for Channel Assignment in Radio Networks
  Wireless Networks, 2001
• A partial k-arboretum of graphs with bounded treewidth
  Theoretical Computer Science, 1998
• A new model for scheduling packet radio networks
  Wireless Networks, 1997
• Algorithms for Square Roots of Graphs
  SIAM Journal on Discrete Mathematics, 1995
• Computing roots of graphs is hard
  Discrete Applied Mathematics, 1994
• Approximation algorithms for NP-complete problems on planar graphs
  Journal of the ACM, 1994
• Scheduling algorithms for multihop radio networks
  IEEE/ACM Transactions on Networking, 1993
• Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
  Mathematical Programming, 1983
• Decomposition of Finite Graphs Into Forests
  Journal of the London Mathematical Society, 1964