AbstractWe prove the conjecture made by O. V. Borodin in 1976 that the vertex set of any planar graph can be decomposed into two sets such that one of them induces a 3-degenerate graph and the other induces a 2-degenerate graph, that is, a forest
8 pages, 4 figuresLet G be a connected graph with maximum degree ∆ ≥ 3 distinct from K∆+1. Generaliz...
8 pages, 4 figuresLet G be a connected graph with maximum degree ∆ ≥ 3 distinct from K∆+1. Generaliz...
graph (Formula presented.) is (Formula presented.) -degenerate if every nonnull subgraph of (Formula...
AbstractWe prove the conjecture made by O. V. Borodin in 1976 that the vertex set of every planar gr...
AbstractWe prove the conjecture made by O. V. Borodin in 1976 that the vertex set of every planar gr...
It is shown that a planar graph can be partitioned into three linear forests. The sharpness of the r...
AbstractW. He et al. showed that a planar graph of girth 11 can be decomposed into a forest and a ma...
AbstractWe prove that each simple planar graph G whose all faces are quadrilaterals can be decompose...
AbstractThe fractional arboricity γf(G) of a graph G is the maximum of the ratio |E(G[X])|/(|X|−1) o...
The 3‐Decomposition Conjecture states that every connected cubic graph can be decomposed into a span...
The 3‐Decomposition Conjecture states that every connected cubic graph can be decomposed into a span...
A graph G is k-degenerated if it can be deleted by subsequent removals of vertices of degree k or le...
W. He et al. showed that a planar graph not containing 4-cycles can be decomposed into a forest and ...
AbstractThe vertex-arboricity a(G) of a graph G is the minimum number of subsets into which the set ...
An equitable k-partition of a graph G is a collection of induced subgraphs (G[V-1], G[V-2], ... , G[...
8 pages, 4 figuresLet G be a connected graph with maximum degree ∆ ≥ 3 distinct from K∆+1. Generaliz...
8 pages, 4 figuresLet G be a connected graph with maximum degree ∆ ≥ 3 distinct from K∆+1. Generaliz...
graph (Formula presented.) is (Formula presented.) -degenerate if every nonnull subgraph of (Formula...
AbstractWe prove the conjecture made by O. V. Borodin in 1976 that the vertex set of every planar gr...
AbstractWe prove the conjecture made by O. V. Borodin in 1976 that the vertex set of every planar gr...
It is shown that a planar graph can be partitioned into three linear forests. The sharpness of the r...
AbstractW. He et al. showed that a planar graph of girth 11 can be decomposed into a forest and a ma...
AbstractWe prove that each simple planar graph G whose all faces are quadrilaterals can be decompose...
AbstractThe fractional arboricity γf(G) of a graph G is the maximum of the ratio |E(G[X])|/(|X|−1) o...
The 3‐Decomposition Conjecture states that every connected cubic graph can be decomposed into a span...
The 3‐Decomposition Conjecture states that every connected cubic graph can be decomposed into a span...
A graph G is k-degenerated if it can be deleted by subsequent removals of vertices of degree k or le...
W. He et al. showed that a planar graph not containing 4-cycles can be decomposed into a forest and ...
AbstractThe vertex-arboricity a(G) of a graph G is the minimum number of subsets into which the set ...
An equitable k-partition of a graph G is a collection of induced subgraphs (G[V-1], G[V-2], ... , G[...
8 pages, 4 figuresLet G be a connected graph with maximum degree ∆ ≥ 3 distinct from K∆+1. Generaliz...
8 pages, 4 figuresLet G be a connected graph with maximum degree ∆ ≥ 3 distinct from K∆+1. Generaliz...
graph (Formula presented.) is (Formula presented.) -degenerate if every nonnull subgraph of (Formula...
DOI
Add to ORKG