Time optimal d-list colouring of a graph

DOI10.1007/978-3-642-13182-0_15MaRDI QIDQ3569740zbMATH OpenOpenAlexFDO

Authors N. V. Gravin

Publication date 22 June 2010

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13182-0_15

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Δ-List Vertex Coloring in Linear Time
• -list vertex coloring in linear time
• An optimal distributed \((\Delta+1)\)-coloring algorithm?
• Algorithmic aspects of partial list colourings
• New linear-time algorithms for edge-coloring planar graphs

Cited in

(2)

• Δ-List Vertex Coloring in Linear Time
• \(\Delta \)-list vertex coloring in linear time

This page was built for publication: Time optimal \(d\)-list colouring of a graph

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