The following pages link to Bounded max-colorings of graphs (Q2447538):
Displaying 12 items.
- The complexity of changing colourings with bounded maximum degree (Q407523) (← links)
- Maximum number of colors: C-coloring and related problems (Q408951) (← links)
- Max-coloring paths: tight bounds and extensions (Q454245) (← links)
- Bounded vertex colorings of graphs (Q686481) (← links)
- Clique clustering yields a PTAS for max-coloring interval graphs (Q722535) (← links)
- Sparse \(H\)-colourable graphs of bounded maximum degree (Q1889843) (← links)
- Maximal ambiguously \(k\)-colorable graphs (Q2284731) (← links)
- The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size (Q2685343) (← links)
- Bounded Max-colorings of Graphs (Q3060747) (← links)
- Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs (Q3449868) (← links)
- Some new bounds for the maximum number of vertex colorings of a (v,e)-graph (Q4242963) (← links)
- Automata, Languages and Programming (Q5716853) (← links)
