AbstractW. He et al. showed that a planar graph of girth 11 can be decomposed into a forest and a matching. D. Kleitman et al. proved the same statement for planar graphs of girth 10. We further improve the bound on girth to 9
We proved that every planar triangle-free graph of order n has a subset of vertices that induces a f...
AbstractWe prove that each simple planar graph G whose all faces are quadrilaterals can be decompose...
It is known that a planar graph on n vertices has branch-width/tree-width bounded by alphasqrt{n}. I...
AbstractW. He et al. showed that a planar graph of girth at least 11 can be decomposed into a forest...
W. He et al. showed that a planar graph not containing 4-cycles can be decomposed into a forest and ...
AbstractThe fractional arboricity γf(G) of a graph G is the maximum of the ratio |E(G[X])|/(|X|−1) o...
It is known that a planar graph on n vertices has branch-width/tree-width bounded by # # n
International audienceWe prove that every planar graph has an edge partition into three forests, one...
We proved that every planar triangle-free graph with n vertices has a subset of vertices that induce...
The girth of a graph G has been defined as the length of a shortest cycle of G. We design an O(n(5/4...
DOI 10.1002/jgt.20121 Abstract: It is known that a planar graph on n vertices has branch-width/ tree...
As defined ingraph theory, the girth of a given graph is the length of its shortest cycle. Most of t...
AbstractWe prove the conjecture made by O. V. Borodin in 1976 that the vertex set of any planar grap...
We proved that every planar triangle-free graph of order n has a subset of vertices that induces a f...
AbstractWe prove that every planar graph has an edge partition into three forests, one having maximu...
We proved that every planar triangle-free graph of order n has a subset of vertices that induces a f...
AbstractWe prove that each simple planar graph G whose all faces are quadrilaterals can be decompose...
It is known that a planar graph on n vertices has branch-width/tree-width bounded by alphasqrt{n}. I...
AbstractW. He et al. showed that a planar graph of girth at least 11 can be decomposed into a forest...
W. He et al. showed that a planar graph not containing 4-cycles can be decomposed into a forest and ...
AbstractThe fractional arboricity γf(G) of a graph G is the maximum of the ratio |E(G[X])|/(|X|−1) o...
It is known that a planar graph on n vertices has branch-width/tree-width bounded by # # n
International audienceWe prove that every planar graph has an edge partition into three forests, one...
We proved that every planar triangle-free graph with n vertices has a subset of vertices that induce...
The girth of a graph G has been defined as the length of a shortest cycle of G. We design an O(n(5/4...
DOI 10.1002/jgt.20121 Abstract: It is known that a planar graph on n vertices has branch-width/ tree...
As defined ingraph theory, the girth of a given graph is the length of its shortest cycle. Most of t...
AbstractWe prove the conjecture made by O. V. Borodin in 1976 that the vertex set of any planar grap...
We proved that every planar triangle-free graph of order n has a subset of vertices that induces a f...
AbstractWe prove that every planar graph has an edge partition into three forests, one having maximu...
We proved that every planar triangle-free graph of order n has a subset of vertices that induces a f...
AbstractWe prove that each simple planar graph G whose all faces are quadrilaterals can be decompose...
It is known that a planar graph on n vertices has branch-width/tree-width bounded by alphasqrt{n}. I...
DOI
Add to ORKG