Partitioning a graph into a cycle and a sparse graph

25 Jul 2016 Pokrovskiy Alexey

In this paper we investigate results of the form "every graph $G$ has a cycle $C$ such that the induced subgraph of $G$ on $V(G)\setminus V(C)$ has small maximum degree." Such results haven't been studied before, but are motivated by the Bessy and Thomass\'e Theorem which states that the vertices of any graph $G$ can be covered by a cycle $C_1$ in $G$ and disjoint cycle $C_2$ in the complement of $G$... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS