We proved that every planar triangle-free graph of order n has a subset of vertices that induces a forest of size at least (71n + 72)/128. This improves the earlier work of Salavatipour (2006). We also pose some questions regarding planar graphs of higher girth
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...
AbstractThe vertex-arboricity a(G) of a graph G is the minimum number of subsets into which the set ...
We proved that every planar triangle-free graph with n vertices has a subset of vertices that induce...
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...
AbstractFor a graph G, let t(G) denote the maximum number of vertices in an induced subgraph of G th...
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 11 can be decomposed into a forest and a ma...
In 1975, Erdos proposed the problem of determining the maximal number of edges in a graph on n verti...
International audienceAn $({\cal F},{\cal F}_d)$-partition of a graph is a vertex-partition into two...
W. He et al. showed that a planar graph not containing 4-cycles can be decomposed into a forest and ...
AbstractW. He et al. showed that a planar graph of girth at least 11 can be decomposed into a forest...
AbstractWe prove that every planar graph has an edge partition into three forests, one having maximu...
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...
AbstractThe vertex-arboricity a(G) of a graph G is the minimum number of subsets into which the set ...
We proved that every planar triangle-free graph with n vertices has a subset of vertices that induce...
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...
AbstractFor a graph G, let t(G) denote the maximum number of vertices in an induced subgraph of G th...
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 11 can be decomposed into a forest and a ma...
In 1975, Erdos proposed the problem of determining the maximal number of edges in a graph on n verti...
International audienceAn $({\cal F},{\cal F}_d)$-partition of a graph is a vertex-partition into two...
W. He et al. showed that a planar graph not containing 4-cycles can be decomposed into a forest and ...
AbstractW. He et al. showed that a planar graph of girth at least 11 can be decomposed into a forest...
AbstractWe prove that every planar graph has an edge partition into three forests, one having maximu...
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...
AbstractThe vertex-arboricity a(G) of a graph G is the minimum number of subsets into which the set ...
DOI
Add to ORKG