The number of cut-edges and conflict-free connection number in planar graphs
Abstract
A cut-edge of a connected graph is an edge whose deletion increases the number of components. In this paper, we first state some conditions for a planar graph to have a few cut-edges. After that, we use the main results to study the conditions for a colored planar graph to have a bounded conflict-free connection number.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.