Pages that link to "Item:Q3515882"
From MaRDI portal
The following pages link to On a graph coloring problem arising from discrete tomography (Q3515882):
Displaying 10 items.
- Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem (Q617894) (← links)
- Graph coloring with cardinality constraints on the neighborhoods (Q1040081) (← links)
- On the approximability of the maximum interval constrained coloring problem (Q1662109) (← links)
- Histogram tomography (Q2099370) (← links)
- Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable (Q2434306) (← links)
- Using graphs for some discrete tomography problems (Q2581557) (← links)
- Tomography on Finite Graphs (Q3439188) (← links)
- Degree-constrained edge partitioning in graphs arising from discrete tomography (Q3627968) (← links)
- On the use of graphs in discrete tomography (Q5900257) (← links)
- On the use of graphs in discrete tomography (Q5900894) (← links)