Linear-time algorithm for vertex 2-coloring without monochromatic triangles on planar graphs
Abstract
In the problem of 2-coloring without monochromatic triangles (or triangle-tree 2-coloring), vertices of the simple, connected, undirected graph are colored with either 'black' or 'white' such that there are no 3 mutually adjacent vertices of the same color. In this paper we are positively answering the question posed in our previous work, namely, if there exists an algorithm solving 2-coloring without monochromatic triangles on planar graphs with linear-time complexity.
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.