306 search results - page 1 / 62 » Computing the Girth of a Planar Graph |
GC
2002
Springer
14 years 10 months ago
2002
Springer
The main result of the papzer is that any planar graph with odd girth at least 10k
ICALP
2000
Springer
15 years 1 months ago
2000
Springer
We give an O(n log n) algorithm for computing the girth (shortest cycle) of an undirected n-vertex planar graph. Our solution extends to any graph of bounded genus. This improves u...
83
Voted
DMTCS
2010
14 years 7 months ago
2010
We proved that every planar triangle-free graph with n vertices has a subset of vertices that induces a forest of size at least (71n + 72)/128. This improves the earlier work of S...
70
Voted
EJC
2008
14 years 10 months ago
2008
Wang and Lih conjectured that for every g 5, there exists a number M(g) such that the square of a planar graph G of girth at least g and maximum degree M(g) is (+1)-colorable. ...
82
Voted
JGT
2006
14 years 10 months ago
2006
Jeager et al introduced a concept of group connectivity as an generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected...