MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "On the number of plane graphs." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

6 documents found, showing 1 through 6.

ATOM

On the number of plane graphs
by Oswin Aichholzer, Thomas Hackl, Clemens Huemer, Ferran Hurtado, Hannes Krasser, Birgit Vogtenhuber — 2006 — Proc. 17th Ann. ACM-SIAM Symp. on Discrete Algorithms
…Bounding the Number of Plane Graphs Oswin Aichholzer 1 , Thomas Hackl 1 , Clemens Huemer 2…
Cited by 8 (1 self) – Add To MetaCart

Encoding fullerenes and geodesic domes
by Jack E. Graver — 2004 — SIAM. J. Discrete Math
… number of distinct planar embeddings, there are only a finite number of plane graphs which could…
Cited by 3 (2 self) – Add To MetaCart

Parameterized Computational Feasibility
by Rodney G. Downey, Michael R. Fellows — 1994 — Feasible Mathematics II
…] on the face cover number of plane graphs. The problems that we consider are defined as follows. Vertex Cover…
Cited by 56 (16 self) – Add To MetaCart

Computing Sciences Universiteit Utrecht
by Noga Alon, Maike Buchin, Bettina Speckmann, Tu Eindhoven, Robert Berke, Péter Csorba, Tu Eindhoven, Kevin Buchin
… the minimum possible polychromatic number for plane graphs G with g(G) = g. Theorem 2. p(1) = p(2) = 1, p(3…
Add To MetaCart

Shortest path queries in planar graphs in constant time
by Łukasz Kowalik — 2003 — In STOC’03
… conditions should be satisfied: (i) Each graph Gi is a union of a constant number of plane graphs…
Cited by 3 (2 self) – Add To MetaCart

Oracles for bounded length shortest paths in planar graphs
by Maciej Kurowski — ACM Trans. Algorithms
… graph Gi is a union of a bounded number of plane graphs and therefore it can be O(1)-oriented. Notice…
Cited by 2 (0 self) – Add To MetaCart

Showing 1 through 6.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB