On-line P-coloring of graphs

DOI10.7151/DMGT.1331MaRDI QIDQ5437222zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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 algorithmhereditary propertygraph colouringon-line algorithmstingy algorithm

Mathematics Subject Classification ID

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

Recommendations

• On-Line and First-fit Coloring of Graphs that Do Not Induce $P_5 $
• On-line coloring of \(I_{s}\)-free graphs
• scientific article; zbMATH DE number 65699
• On-line and first fit colorings of graphs
• On-line 3-chromatic graphs. II: Critical graphs

Cited in

(14)

• Online Bounded Coloring of Permutation and Overlap Graphs
• Online coloring co-interval graphs
• Application of polynomial method to on-line list colouring of graphs
• A tight bound for online colouring of disk graphs
• Iterated colorings of graphs.
• Online multi-coloring on the path revisited
• Online edge coloring via tree recurrences and correlation decay
• Online hypergraph coloring with rejection
• Computational aspects of greedy partitioning of graphs
• On-line approach to off-line coloring problems on graphs with geometric representations
• scientific article; zbMATH DE number 1303205 (Why is no real title available?)
• On-line choice number of complete multipartite graphs: an algorithmic approach
• scientific article; zbMATH DE number 65708 (Why is no real title available?)
• Online Dual Edge Coloring of Paths and Trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5437222)