202 search results - page 27 / 41 » On the Queue Number of Planar Graphs |
JCT
2007
14 years 9 months ago
2007
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and T´oth proved that a graph can always be redrawn so...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
102
click to vote
DM
2010
14 years 9 months ago
2010
Let Mad(G) denote the maximum average degree (over all subgraphs) of G and let i(G) denote the injective chromatic number of G. We prove that if Mad(G) 5 2 , then i(G) + 1; sim...
DAM
2010
14 years 9 months ago
2010
A dynamic coloring of a graph is a proper coloring of its vertices such that every vertex of degree more than one has at least two neighbors with distinct colors. The least number...