A Fast Algorithm for the Product Structure of Planar Graphs

Dujmovic et al (FOCS2019) recently proved that every planar graph $G$ is a subgraph of $H\boxtimes P$, where $\boxtimes$ denotes the strong graph product, $H$ is a graph of treewidth 8 and $P$ is a path. This result has found numerous applications to linear graph layouts, graph colouring, and graph labelling. The proof given by Dujmovic et al is based on a similar decomposition of Pilipczuk and Siebertz (SODA2019) which is constructive and leads to an $O(n^2)$ time algorithm for finding $H$ and the mapping from $V(G)$ onto $V(H\boxtimes P)$. In this note, we show that this algorithm can be made to run in $O(n\log n)$ time.

[1]  Alexander Grigoriev,et al.  Algorithms for Graphs Embeddable with Few Crossings per Edge , 2005, Algorithmica.

[2]  Noga Alon,et al.  Nonrepetitive colorings of graphs , 2002, Random Struct. Algorithms.

[3]  Pat Morin,et al.  Planar Graphs have Bounded Queue-Number , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).

[4]  Moni Naor,et al.  Implicit representation of graphs , 1992, STOC '88.

[5]  Bojan Mohar,et al.  A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface , 1999, SIAM J. Discret. Math..

[6]  John C. Urschel,et al.  Testing k-planarity is NP-complete , 2019, 1907.02104.

[7]  Vladimir P. Korzhik,et al.  Minimal Obstructions for 1‐Immersions and Hardness of 1‐Planarity Testing , 2009, J. Graph Theory.

[8]  Michal Pilipczuk,et al.  Polynomial bounds for centered colorings on proper minor-closed graph classes , 2018, SODA.

[9]  Jaroslav Nesetril,et al.  Grad and classes with bounded expansion I. Decompositions , 2008, Eur. J. Comb..

[10]  Stefan Felsner,et al.  Improved bounds for centered colorings , 2019, SODA.

[11]  Pat Morin,et al.  The structure of k-planar graphs , 2019, ArXiv.

[12]  J. Nesetril,et al.  Grad and classes with bounded expansion III. restricted dualities , 2005, math/0508325.

[13]  John C. Urschel,et al.  Testing gap k-planarity is NP-complete , 2021, Inf. Process. Lett..

[14]  Cyril Gavoille,et al.  Adjacency Labelling for Planar Graphs (and Beyond) , 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).

[15]  Robert E. Tarjan,et al.  A linear-time algorithm for a special case of disjoint set union , 1983, J. Comput. Syst. Sci..

[16]  Jaroslav Nesetril,et al.  Tree-depth, subgraph coloring and homomorphism bounds , 2006, Eur. J. Comb..

[17]  David R. Wood,et al.  Planar graphs have bounded nonrepetitive chromatic number , 2019, ArXiv.

[18]  Arnold L. Rosenberg,et al.  Comparing Queues and Stacks as Mechanisms for Laying out Graphs , 1992, SIAM J. Discret. Math..