Δ-List Vertex Coloring in Linear Time

DOI10.1007/3-540-45471-3_25zbMATH Open1078.05529OpenAlexW327495823MaRDI QIDQ3046497FDOQ3046497

Authors: San Skulrattanakulchai 

Publication date: 12 August 2004

Published in: Algorithm Theory — SWAT 2002 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-45471-3_25

Recommendations

• \(\Delta \)-list vertex coloring in linear time
• Linear colorings of subcubic graphs
• Time optimal \(d\)-list colouring of a graph
• scientific article; zbMATH DE number 2089961
• COLORING ALGORITHMS ON SUBCUBIC GRAPHS

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15)

Cited In (9)

• \(\Delta \)-list vertex coloring in linear time
• Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for \(\Delta\)-coloring
• COLORING ALGORITHMS ON SUBCUBIC GRAPHS
• Brooks' theorem for generalized dart graphs
• Time optimal \(d\)-list colouring of a graph
• Dichotomy for coloring of dart graphs
• Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
• (\(\Delta-k\))-critical graphs
• Title not available (Why is that?)

This page was built for publication: Δ-List Vertex Coloring in Linear Time

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