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 18 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)
- Polynomial cases of graph decomposition: A complete solution of Holyer's problem (Q1024436) (← links)
- Edge decompositions into two kinds of graphs (Q1045169) (← links)
- On the complexity of partitioning graphs into connected subgraphs (Q1057062) (← links)
- Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations (Q1399253) (← links)
- Improved approximation algorithms for weighted 2-path partitions (Q1706113) (← links)
- On some multigraph decomposition problems and their computational complexity (Q1827716) (← links)
- Exact algorithms for finding longest cycles in claw-free graphs (Q1939671) (← links)
- Critical edges for the assignment problem: complexity and exact resolution (Q2450758) (← links)
- Edge decompositions and rooted packings of graphs (Q2675822) (← links)
- (Q3368883) (← links)
- Improved Approximation Algorithms for Weighted 2-Path Partitions (Q3452854) (← links)
- (Q3748301) (← links)
- (Q4263718) (← links)
- Edge Bipartization Faster Than 2^k (Q4634410) (← links)
- Chain partitions of ordered sets (Q5917347) (← links)
- (Q6068263) (← links)