Packings by cliques and by finite families of graphs
From MaRDI portal
Publication:1068852
DOI10.1016/0012-365X(84)90150-XzbMath0582.05046MaRDI QIDQ1068852
Pavol Hell, David G. Kirkpatrick
Publication date: 1984
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Packings by Complete Bipartite Graphs, Unnamed Item, On matroids induced by packing subgraphs, Optimal packing of induced stars in a graph, Unnamed Item, On the complexity of some edge-partition problems for graphs, A greedy algorithm for the social golfer and the Oberwolfach problem, Maximum tree-packing in time \(O(n^{5/2})\), Edge decompositions and rooted packings of graphs, Maximum tree-packing in time O(n5/2), Packing 2- and 3-stars into cubic graphs, The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices, Packing $k$-Matchings and $k$-Critical Graphs, How many matchings cover the nodes of a graph?, Approximating the directed path partition problem, Pareto optimality in coalition formation, On the use of augmenting chains in chain packings, On the tree packing problem, Approximation algorithms and hardness results for the clique packing problem, Approximation algorithms and hardness results for the clique packing problem, Oriented star packings, Chain partitions of ordered sets, On maximum \(P_3\)-packing in claw-free subcubic graphs, An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem, On the complexity of digraph packings, Generalized partitions of graphs, Maker-Breaker domination game, The Nonnegative Node Weight j-Restricted k-Matching Problems, A surprising permanence of old motivations (a not-so-rigid story), Edge decompositions into two kinds of graphs, Independent packings in structured graphs, Chain packing in graphs, On the complexity of a family of generalized matching problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A matching problem with side conditions
- On generalized matching problems
- Packing subgraphs in a graph
- On the Complexity of General Graph Factor Problems
- Packings by Complete Bipartite Graphs
- Paths, Trees, and Flowers
- On the completeness of a generalized matching problem
- Maximum matching and a polyhedron with 0,1-vertices
- The Factorization of Linear Graphs
