Connected Greedy Colourings
From MaRDI portal
Publication:5405062
DOI10.1007/978-3-642-54423-1_38zbMath1405.68126OpenAlexW162139223MaRDI QIDQ5405062
No author found.
Publication date: 31 March 2014
Published in: LATIN 2014: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-54423-1_38
Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
The connected greedy coloring game ⋮ A note on connected greedy edge colouring ⋮ Complexity of Grundy coloring and its variants ⋮ Connected greedy coloring of \(H\)-free graphs
This page was built for publication: Connected Greedy Colourings