\(\Delta \)-list vertex coloring in linear time

DOI10.1016/j.ipl.2005.12.007zbMath1178.05044OpenAlexW2065590056MaRDI QIDQ844167

San Skulrattanakulchai

Publication date: 18 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.12.007

zbMATH Keywords

algorithmsgraph coloringgraph algorithmsvertex coloringlist coloringBrooks' theorem

Mathematics Subject Classification ID

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

Related Items (5)

Domination chain: characterisation, classical complexity, parameterised complexity and approximability ⋮ Linear colorings of subcubic graphs ⋮ Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs ⋮ On the complexity of the smallest grammar problem over fixed alphabets ⋮ All subgraphs of a wheel are 5-coupled-choosable

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Path-based depth-first search for strong and biconnected components
• Three short proofs in graph theory
• Dividing a Graph into Triconnected Components
• Depth-First Search and Linear Graph Algorithms
• COLORING ALGORITHMS ON SUBCUBIC GRAPHS
• 25 pretty graph colouring problems

This page was built for publication: \(\Delta \)-list vertex coloring in linear time