Chromatic number of ISK4-free graphs
Abstract
A graph G is said to be ISK4-free if it does not contain any subdivision of K4 as an induced subgraph. In this paper, we propose new upper bounds for chromatic number of ISK4-free graphs and \ISK4, triangle\-free graphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.