Oracles for bounded length shortest paths in planar graphs

Cached

Download Links

by Maciej Kurowski
Venue:ACM Trans. Algorithms
Citations:4 - 0 self

Documents Related by Co-Citation

7 Fast 3-Coloring Triangle-Free Planar Graphs – Łukasz Kowalik - 2004
68 Ein Dreifarbensatz für dreikreisfreie Netze auf der – H Grötzsch - 1959
9 Three-coloring triangle-free graphs on surfaces I. Extending a coloring . . . – Zdeněk Dvorák, Daniel Král, Robin Thomas - 2010
30 Grötzsch’s 3-color theorem and its counterparts for the torus and the projective plane – C Thomassen - 1994
46 Graph minors. VII. Disjoint paths on a surface – N Robertson, P D Seymour - 1988
22 Coloring graphs with fixed genus and girth – John Gimbel, Carsten Thomassen - 1997
10 The chromatic number of a graph of girth 5 on a fixed surface – C Thomassen
10988 Computers and Intractability: A Guide to the Theory of NP-completeness – M Garey, D Johnson - 1979
212 Graphs on surfaces – Bojan Mohar, Bojan Mohar - 2001
7 Three-coloring triangle-free planar graphs in linear time, Trans. on Algorithms – Z Dvoˇrák, K Kawarabayashi, R Thomas
14 Ossona de Mendez, P.: Linear time low tree-width partitions and algorithmic consequences – J Neˇsetˇril - 2006
21 Ossona de Mendez, P.: Grad and classes with bounded expansion III. restricted graph homomorphism dualities – J Neˇsetˇril - 2008
113 Subgraph Isomorphism in Planar Graphs and Related Problems – David Eppstein - 1999
2 A new planarity test, Theoret – W-K Shih, W-L Hsu - 1999
7 Three-Coloring Klein Bottle Graphs Of Girth Five – Robin Thomas, Barrett Walls - 2004
76 Planar graphs: Theory and algorithms – T Nishizeki, N Chiba
32 Depth-first search and Kuratowski subgraphs – S G Williamson - 1984
15 Graphs on Surfaces, The Johns Hopkins – B Mohar, C Thomassen - 2001
38 Every planar map is four colorable. part I. discharging – K Appel, W Haken - 1977