388 search results - page 32 / 78 » On the Number of Cycles in Planar Graphs |
181
Voted
ALGORITHMICA
1998
15 years 5 months ago
1998
In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter ε such that 0 < ε, our algorit...
190
click to vote
COCOON
1999
Springer
15 years 10 months ago
1999
Springer
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
109
click to vote
BIRTHDAY
2009
Springer
16 years 27 days ago
2009
Springer
In this paper, we consider a number of results and six conjectures on properly coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prov...
134
Voted
JGT
2007
15 years 6 months ago
2007
: A (directed) cycle C in a graph is called consistent provided there exists an automorphism of , acting as a 1-step rotation of C. A beautiful but not well-known result of J.H. Co...
149
click to vote
DAM
2008
15 years 6 months ago
2008
For a graph G, let fij be the number of spanning rooted forests in which vertex j belongs to a tree rooted at i. In this paper, we show that for a path, the fij's can be expr...