Pages that link to "Item:Q2034069"
From MaRDI portal
The following pages link to A generalization of Stiebitz-type results on graph decomposition (Q2034069):
Displaying 9 items.
- Efficient algorithms for decomposing graphs under degree constraints (Q881575) (← links)
- Partitions of multigraphs under minimum degree constraints (Q1730245) (← links)
- Decomposition of graphs with constraint on minimum degree (Q2172390) (← links)
- Partitions of graphs and multigraphs under degree constraints (Q2181223) (← links)
- On a conjecture of Schweser and Stiebitz (Q2661211) (← links)
- Stanton graph decompositions (Q2910016) (← links)
- Applications of the Wold decomposition to the study of row contractions associated with directed graphs (Q4679391) (← links)
- Graph partitioning: an updated survey (Q6110873) (← links)
- Bounds for the decomposition dimension of some class of graphs (Q6132886) (← links)