Search Results - "planar graph" :: UTM Library Massive Scholar Tracking

1

The number of planar graphs and properties of random planar graphs by Omer Gimenez, Marc Noy

Published 2005-01-01

Subjects:

Get full text

Article

2

Planar graph drawing / by Takao, Nishizeki, 1947-, Rahman, Md. Saidur

Published 2004

3

Random planar graphs by McDiarmid, C, Steger, A, Welsh, D

Published 2005

“…We study various properties of the random planar graph Rn, drawn uniformly at random from the class Pn of all simple planar graphs on n labelled vertices. …”

Journal article

4

Random planar graphs. by Mcdiarmid, C, Steger, A, Welsh, D

Published 2005

Journal article

5

Planar Graphs And Coloring by Manogaran, Lavaneesvari

Published 2010

“…Here come the notions of planar graph and the concept of coloring to make the modeling by graphs more efficient.…”

Get full text

Thesis

6

Planar graphs : theory and algorithms / by Nishizeki, T. (Takao), 1947-, Chiba, N

Published 1988

7

WORM Colorings of Planar Graphs by Czap J., Jendrol’ S., Valiska J.

Published 2017-05-01

“…Given three planar graphs F,H, and G, an (F,H)-WORM coloring of G is a vertex coloring such that no subgraph isomorphic to F is rainbow and no subgraph isomorphic to H is monochromatic. …”

Get full text

Article

8

Triangle Decompositions of Planar Graphs by Mynhardt Christina M., Bommel Christopher M. van

Published 2016-08-01

Subjects: “…planar graphs…”

Get full text

Article

9

Planar Embedding of Planar Graphs by Dolev, Danny, Leighton, Frank Thomson, Trickey, Howard

Published 2023

“…Valiant [V] gave an algorithm to construct a planar embedding for trees in linear area; he also proved that there are planar graphs that require quadratic area. We fill in a spectrum between Valiant's results by showing that a N-node planar graph has a planar embedding with area O(NF), where F is a bound on the path length from any node to the exterior face. …”

Get full text

10