Pages that link to "Item:Q910410"
From MaRDI portal
The following pages link to Graph coloring satisfying restraints (Q910410):
Displaying 5 items.
- Restraints permitting the largest number of colourings (Q1786873) (← links)
- Strategic Coloring of a Graph (Q4905096) (← links)
- Coloring Graphs with Constraints on Connectivity (Q4978449) (← links)
- A broken cycle theorem for the restrained chromatic function (Q5742940) (← links)
- Amenable colorings (Q5906786) (← links)