The following pages link to Bounded vertex coloring of trees (Q5937457):
Displaying 7 items.
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (Q653316) (← links)
- Equitable colorings of bounded treewidth graphs (Q817768) (← links)
- Partitioning a weighted partial order (Q927191) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752) (← links)
- Graph coloring with cardinality constraints on the neighborhoods (Q1040081) (← links)
- Scheduling jobs on identical machines with agreement graph (Q1761988) (← links)
- Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization (Q6107887) (← links)
