Add to ORKGA graph $G$ is $d$-degenerate if every non-null subgraph of $G$ has a vertex of degree at most $d$. We prove that every $n$-vertex planar graph has a $3$-degenerate induced subgraph of order at least $3n/4$.Comment: 28 page
AbstractThe vertex-arboricity a(G) of a graph G is the minimum number of subsets into which the set ...
A graph is 2-degenerate if every subgraph contains a vertex of degree at most 2. We show that every ...
The nonplanar vertex deletion or vertex deletion vd (G) of a graph G is the smallest nonnegative int...
graph (Formula presented.) is (Formula presented.) -degenerate if every nonnull subgraph of (Formula...
A graph G is k-degenerated if it can be deleted by subsequent removals of vertices of degree k or le...
AbstractWe prove the conjecture made by O. V. Borodin in 1976 that the vertex set of every planar gr...
AbstractIt is well known that the spectral radius of a tree whose maximum degree is Δ cannot exceed ...
A linear forest is a union of vertex-disjoint paths, and the linear arboricity of a graph $G$, denot...
AbstractIt is proved that a planar graph G without five cycles is three degenerate, hence, four choo...
Join the meeting at this link.Non UBCUnreviewedAuthor affiliation: Institute for Basic ScienceResear...
It is easy to see that planar graphs without 3-cycles are 3-degenerate. Recently, it was proved that...
AbstractIt is easy to see that planar graphs without 3-cycles are 3-degenerate. Recently, it was pro...
AbstractWe prove that every 3-connected planar graph G of order at least k contains a connected subg...
Motivated by the study of greedy algorithms for graph coloring, we introduce a new graph parameter, ...
AbstractIt is proved that every 3-connected planar graph G with δ(G)⩾4 either does not contain any p...
AbstractThe vertex-arboricity a(G) of a graph G is the minimum number of subsets into which the set ...
A graph is 2-degenerate if every subgraph contains a vertex of degree at most 2. We show that every ...
The nonplanar vertex deletion or vertex deletion vd (G) of a graph G is the smallest nonnegative int...
graph (Formula presented.) is (Formula presented.) -degenerate if every nonnull subgraph of (Formula...
A graph G is k-degenerated if it can be deleted by subsequent removals of vertices of degree k or le...
AbstractWe prove the conjecture made by O. V. Borodin in 1976 that the vertex set of every planar gr...
AbstractIt is well known that the spectral radius of a tree whose maximum degree is Δ cannot exceed ...
A linear forest is a union of vertex-disjoint paths, and the linear arboricity of a graph $G$, denot...
AbstractIt is proved that a planar graph G without five cycles is three degenerate, hence, four choo...
Join the meeting at this link.Non UBCUnreviewedAuthor affiliation: Institute for Basic ScienceResear...
It is easy to see that planar graphs without 3-cycles are 3-degenerate. Recently, it was proved that...
AbstractIt is easy to see that planar graphs without 3-cycles are 3-degenerate. Recently, it was pro...
AbstractWe prove that every 3-connected planar graph G of order at least k contains a connected subg...
Motivated by the study of greedy algorithms for graph coloring, we introduce a new graph parameter, ...
AbstractIt is proved that every 3-connected planar graph G with δ(G)⩾4 either does not contain any p...
AbstractThe vertex-arboricity a(G) of a graph G is the minimum number of subsets into which the set ...
A graph is 2-degenerate if every subgraph contains a vertex of degree at most 2. We show that every ...
The nonplanar vertex deletion or vertex deletion vd (G) of a graph G is the smallest nonnegative int...