Packing subgraphs in a graph
From MaRDI portal
Publication:1166429
DOI10.1016/0167-6377(82)90016-5zbMath0488.90070OpenAlexW2067665587MaRDI QIDQ1166429
William R. Pulleyblank, Cornuéjols, Gérard, David B. Hartvigsen
Publication date: 1982
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(82)90016-5
matchingpolynomial algorithmtriangle packingmatching matroidnode partitionclique packinghypomatchable critical graph
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Related Items
Gadget classification, General factors of graphs, Fractional matchings and the Edmonds-Gallai theorem, The superstar packing problem, Packings by Complete Bipartite Graphs, Unnamed Item, On matroids induced by packing subgraphs, Graph factors and factorization: 1985--2003: a survey, Ear-slicing for matchings in hypergraphs, Unnamed Item, Induced graph packing problems, On the complexity of some edge-partition problems for graphs, An improved approximation ratio for the jump number problem on interval orders, Edge decompositions and rooted packings of graphs, Antifactors of regular bipartite graphs, Optimal general factor problem and jump system intersection, Single-Player and Two-Player Buttons & Scissors Games, Tractable cases of the extended global cardinality constraint, Packing $k$-Matchings and $k$-Critical Graphs, Pareto optimality in coalition formation, Tackling the jump number of interval orders, On the tree packing problem, Matchings of cycles and paths in directed graphs, Approximate triclique coloring for register allocation, Packings and perfect path double covers of maximal planar graphs, Packing triangles in low degree graphs and indifference graphs, Oriented star packings, Clustering with lower-bounded sizes. A general graph-theoretic framework, An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem, Good characterizations for some degree constrained subgraphs, On the complexity of digraph packings, Packing trees with constraints on the leaf degree, Generalized partitions of graphs, The Nonnegative Node Weight j-Restricted k-Matching Problems, Edge decompositions into two kinds of graphs, An extension of matching theory, Independent packings in structured graphs, Chain packing in graphs, Packings by cliques and by finite families of graphs, A refined analysis on the jump number problem of interval orders
Cites Work
