The following pages link to Bounded Max-colorings of Graphs (Q3060747):
Displaying 11 items.
- The complexity of changing colourings with bounded maximum degree (Q407523) (← links)
- Max-coloring paths: tight bounds and extensions (Q454245) (← links)
- Bounded vertex colorings of graphs (Q686481) (← links)
- Sparse \(H\)-colourable graphs of bounded maximum degree (Q1889843) (← links)
- Maximal ambiguously \(k\)-colorable graphs (Q2284731) (← links)
- Clique partitioning with value-monotone submodular cost (Q2339847) (← links)
- Bounded max-colorings of graphs (Q2447538) (← links)
- The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size (Q2685343) (← links)
- Clique Clustering Yields a PTAS for max-Coloring Interval Graphs (Q3012804) (← links)
- Some new bounds for the maximum number of vertex colorings of a (v,e)-graph (Q4242963) (← links)
- Automata, Languages and Programming (Q5716853) (← links)
