A passage time for greedy‐coloring cycles
From MaRDI portal
Publication:4322478
DOI10.1002/rsa.3240060110zbMath0820.68090OpenAlexW2170107205MaRDI QIDQ4322478
Publication date: 9 February 1995
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240060110
Graph theory (including graph drawing) in computer science (68R10) Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15)
Cites Work