-list vertex coloring in linear time

DOI10.1016/J.IPL.2005.12.007zbMATH Open1178.05044OpenAlexW2065590056MaRDI QIDQ844167FDOQ844167

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

Recommendations

• Δ-List Vertex Coloring in Linear Time
• Time optimal \(d\)-list colouring of a graph
• The local nature of \(\Delta\)-coloring and its algorithmic applications
• Linear colorings of subcubic graphs
• Coloring Clique-free Graphs in Linear Expected Time

zbMATH Keywords

algorithmsgraph algorithmsgraph coloringlist coloringBrooks' theoremvertex coloring

Mathematics Subject Classification ID

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

Cites Work

• Introduction to algorithms
• Title not available (Why is that?)
• Depth-First Search and Linear Graph Algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Three short proofs in graph theory
• Title not available (Why is that?)
• 25 pretty graph colouring problems
• Path-based depth-first search for strong and biconnected components
• Dividing a Graph into Triconnected Components
• COLORING ALGORITHMS ON SUBCUBIC GRAPHS

Cited In (7)

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

This page was built for publication: \(\Delta \)-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 Q844167)