Pages that link to "Item:Q1579549"
From MaRDI portal
The following pages link to Feasible edge colorings of trees with cardinality constraints (Q1579549):
Displaying 6 items.
- Minimum entropy coloring (Q1016051) (← links)
- Graph coloring with cardinality constraints on the neighborhoods (Q1040081) (← links)
- Edge dominating set and colorings on graphs with fixed clique-width (Q1861574) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- Bounded max-colorings of graphs (Q2447538) (← links)
- Locally bounded<i>k</i>-colorings of trees (Q3621974) (← links)
