On-line P-coloring of graphs

DOI10.7151/dmgt.1331zbMath1138.05019OpenAlexW2008014112WikidataQ62043631 ScholiaQ62043631MaRDI QIDQ5437222

Piotr Borowiecki

Publication date: 18 January 2008

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1331

zbMATH Keywords

greedy algorithmon-line algorithmgraph colouringhereditary propertystingy algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Computational aspects of greedy partitioning of graphs

This page was built for publication: On-line P-coloring of graphs