A Note on Coloring (4K1, C4, C6)-free graphs with a C7
Abstract
Even-hole-free graphs are a graph class of much interest. Foley et al. [Graphs Comb. 36(1): 125-138 (2020)] have recently studied (4K1, C4, C6)-free graphs, which form a subclass of even-hole-free graphs. Specifically, Foley et al. have shown an algorithm for coloring these graphs via bounded clique-width if they contain a C7. In this note, we give a simpler and much faster algorithm via a more restrictive graph parameter, neighborhood diversity.
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.