Pages that link to "Item:Q3728943"
From MaRDI portal
The following pages link to Packings by Complete Bipartite Graphs (Q3728943):
Displaying 27 items.
- Packing 3-vertex paths in claw-free graphs and related topics (Q617645) (← links)
- Chain packing in graphs (Q808291) (← links)
- Looking at the stars (Q820158) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Edge decompositions into two kinds of graphs (Q1045169) (← links)
- Packings by cliques and by finite families of graphs (Q1068852) (← links)
- On matroids induced by packing subgraphs (Q1109053) (← links)
- On the use of augmenting chains in chain packings (Q1174179) (← links)
- A parameter linked with \(G\)-factors and the binding number (Q1182867) (← links)
- On the tree packing problem (Q1183337) (← links)
- Generalized partitions of graphs (Q1283792) (← links)
- Optimal packing of induced stars in a graph (Q1367032) (← links)
- Maximum tree-packing in time \(O(n^{5/2})\) (Q1391314) (← links)
- Improved approximation algorithms for weighted 2-path partitions (Q1706113) (← links)
- On the complexity of some edge-partition problems for graphs (Q1923590) (← links)
- Rounding in symmetric matrices and undirected graphs (Q1923592) (← links)
- On maximum \(P_3\)-packing in claw-free subcubic graphs (Q2025062) (← links)
- Quantifying hierarchical conflicts in homology statements (Q2163958) (← links)
- On caterpillar factors in graphs (Q2210502) (← links)
- Oriented star packings (Q2483479) (← links)
- Edge decompositions and rooted packings of graphs (Q2675822) (← links)
- Improved Approximation Algorithms for Weighted 2-Path Partitions (Q3452854) (← links)
- (Q4711754) (← links)
- Maximum tree-packing in time O(n5/2) (Q6085700) (← links)
- Packing 2- and 3-stars into cubic graphs (Q6095048) (← links)
- The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices (Q6144493) (← links)
- How many matchings cover the nodes of a graph? (Q6201927) (← links)
