Pages that link to "Item:Q844167"
From MaRDI portal
The following pages link to \(\Delta \)-list vertex coloring in linear time (Q844167):
Displaying 5 items.
- Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs (Q527430) (← links)
- On the complexity of the smallest grammar problem over fixed alphabets (Q2035481) (← links)
- All subgraphs of a wheel are 5-coupled-choosable (Q2115842) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- Linear colorings of subcubic graphs (Q2444734) (← links)
