Pages that link to "Item:Q3627968"
From MaRDI portal
The following pages link to Degree-constrained edge partitioning in graphs arising from discrete tomography (Q3627968):
Displaying 10 items.
- Colour degree matrices of graphs with at most one cycle (Q298973) (← links)
- New sufficient conditions on the degree sequences of uniform hypergraphs (Q831139) (← links)
- Packing tree degree sequences (Q2175807) (← links)
- Edge disjoint caterpillar realizations (Q2217488) (← links)
- Half-regular factorizations of the complete bipartite graph (Q2399287) (← links)
- Constructing bounded degree graphs with prescribed degree and neighbor degree sequences (Q2696614) (← links)
- Solving the Two Color Problem: An Heuristic Algorithm (Q3003544) (← links)
- On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition (Q5237060) (← links)
- On the use of graphs in discrete tomography (Q5900257) (← links)
- On the use of graphs in discrete tomography (Q5900894) (← links)
