Sciweavers

306 search results - page 1 / 62
» Computing the Girth of a Planar Graph
Sort
View
GC
2002
Springer
13 years 3 months ago
n-Tuple Coloring of Planar Graphs with Large Odd Girth
The main result of the papzer is that any planar graph with odd girth at least 10k
William Klostermeyer, Cun-Quan Zhang
ICALP
2000
Springer
13 years 7 months ago
Computing the Girth of a Planar Graph
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...
Hristo Djidjev
DMTCS
2010
133views Mathematics» more  DMTCS 2010»
13 years 1 months ago
An improved bound on the largest induced forests for triangle-free planar graphs
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...
Lukasz Kowalik, Borut Luzar, Riste Skrekovski
EJC
2008
13 years 3 months ago
Coloring squares of planar graphs with girth six
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. ...
Zdenek Dvorak, Daniel Král, Pavel Nejedl&ya...
JGT
2006
98views more  JGT 2006»
13 years 3 months ago
Group chromatic number of planar graphs of girth at least 4
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...
Hong-Jian Lai, Xiangwen Li