Pages that link to "Item:Q1923590"
From MaRDI portal
The following pages link to On the complexity of some edge-partition problems for graphs (Q1923590):
Displaying 8 items.
- On the complexity of deciding whether the regular number is at most two (Q497328) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Edge decompositions into two kinds of graphs (Q1045169) (← links)
- Improved approximation algorithms for weighted 2-path partitions (Q1706113) (← links)
- Exact algorithms for finding longest cycles in claw-free graphs (Q1939671) (← links)
- Edge decompositions and rooted packings of graphs (Q2675822) (← links)
- Improved Approximation Algorithms for Weighted 2-Path Partitions (Q3452854) (← links)
- Chain partitions of ordered sets (Q5917347) (← links)
