3-coloring and 3-clique-ordering of locally connected graphs

DOI10.1016/J.JALGOR.2004.05.003zbMath1074.68665OpenAlexW1988862378MaRDI QIDQ4651818

Martin Kochol

Publication date: 22 February 2005

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgor.2004.05.003

zbMATH Keywords

Graph coloringLinear algorithm\(k\)-Clique-orderingLocally connected graph

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Three colorability characterized by shrinking of locally connected subgraphs into triangles ⋮ Coloring vertices of claw-free graphs in three colors

This page was built for publication: 3-coloring and 3-clique-ordering of locally connected graphs