Add to ORKGWe 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 Salavatipour [10]. We also pose some questions regarding planar graphs of higher girth.
AbstractThe vertex-arboricity a(G) of a graph G is the minimum number of subsets into which the set ...
We show that every graph has an induced pseudoforest of at least n − m/4.5 vertices, an induced part...
We show that every graph has an induced pseudoforest of at least n − m/4.5 vertices, an induced part...
We proved that every planar triangle-free graph of order n has a subset of vertices that induces a f...
We proved that every planar triangle-free graph of order n has a subset of vertices that induces a f...
Tasandilised graafid on graafid, mida saab joonistada tasandile nii, et tema servad ei lõiku üksteis...
AbstractBounds are obtained for the number of vertices in a largest induced forest in a cubic graph ...
International audienceWe prove that every planar graph has an edge partition into three forests, one...
AbstractW. He et al. showed that a planar graph of girth at least 11 can be decomposed into a forest...
AbstractW. He et al. showed that a planar graph of girth 11 can be decomposed into a forest and a ma...
AbstractFor a graph G, let t(G) denote the maximum number of vertices in an induced subgraph of G th...
AbstractWe prove that every planar graph has an edge partition into three forests, one having maximu...
W. He et al. showed that a planar graph not containing 4-cycles can be decomposed into a forest and ...
International audienceAn $({\cal F},{\cal F}_d)$-partition of a graph is a vertex-partition into two...
In 1975, Erdos proposed the problem of determining the maximal number of edges in a graph on n verti...
AbstractThe vertex-arboricity a(G) of a graph G is the minimum number of subsets into which the set ...
We show that every graph has an induced pseudoforest of at least n − m/4.5 vertices, an induced part...
We show that every graph has an induced pseudoforest of at least n − m/4.5 vertices, an induced part...
We proved that every planar triangle-free graph of order n has a subset of vertices that induces a f...
We proved that every planar triangle-free graph of order n has a subset of vertices that induces a f...
Tasandilised graafid on graafid, mida saab joonistada tasandile nii, et tema servad ei lõiku üksteis...
AbstractBounds are obtained for the number of vertices in a largest induced forest in a cubic graph ...
International audienceWe prove that every planar graph has an edge partition into three forests, one...
AbstractW. He et al. showed that a planar graph of girth at least 11 can be decomposed into a forest...
AbstractW. He et al. showed that a planar graph of girth 11 can be decomposed into a forest and a ma...
AbstractFor a graph G, let t(G) denote the maximum number of vertices in an induced subgraph of G th...
AbstractWe prove that every planar graph has an edge partition into three forests, one having maximu...
W. He et al. showed that a planar graph not containing 4-cycles can be decomposed into a forest and ...
International audienceAn $({\cal F},{\cal F}_d)$-partition of a graph is a vertex-partition into two...
In 1975, Erdos proposed the problem of determining the maximal number of edges in a graph on n verti...
AbstractThe vertex-arboricity a(G) of a graph G is the minimum number of subsets into which the set ...
We show that every graph has an induced pseudoforest of at least n − m/4.5 vertices, an induced part...
We show that every graph has an induced pseudoforest of at least n − m/4.5 vertices, an induced part...