-list vertex coloring in linear time
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- scientific article; zbMATH DE number 487720 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 3043302 (Why is no real title available?)
- 25 pretty graph colouring problems
- COLORING ALGORITHMS ON SUBCUBIC GRAPHS
- Depth-First Search and Linear Graph Algorithms
- Dividing a Graph into Triconnected Components
- Introduction to algorithms
- Path-based depth-first search for strong and biconnected components
- Three short proofs in graph theory
Cited in
(8)- All subgraphs of a wheel are 5-coupled-choosable
- Time optimal \(d\)-list colouring of a graph
- Δ-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)