Pages that link to "Item:Q1040081"
From MaRDI portal
The following pages link to Graph coloring with cardinality constraints on the neighborhoods (Q1040081):
Displaying 5 items.
- Reconstructing binary matrices with timetabling constraints (Q350725) (← links)
- Group path covering and distance two labeling of graphs (Q1944096) (← links)
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (Q2238714) (← links)
- Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable (Q2434306) (← links)
- On the use of graphs in discrete tomography (Q5900257) (← links)
