Induced graph packing problems
type: Item
instance of: scholarly article
title: Induced graph packing problems
zbMATH Open document ID: 1230.05236
author: Zoltán Király
author: Jácint Szabó
published in: Graphs and Combinatorics
publication date: 2010-11-12T00:00:00Z
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5815428
zbMATH Keywords: matching
zbMATH Keywords: graph packing
zbMATH Keywords: Gallai-Edmonds structure theorem
MaRDI profile type: Publication
full work available at URL: s00373-010-0906-0
OpenAlex ID: W2034740022
cites work: An extension of matching theory
cites work: Packing subgraphs in a graph
cites work: Perfect triangle-free 2-matchings
cites work: Paths, Trees, and Flowers
cites work: Transversals and matroid partition
cites work: Q4344205
cites work: Q5732334
cites work: Q5508779
cites work: Systems of Distinct Representations and Linear Programming
cites work: Optimal packing of induced stars in a graph
cites work: On the Complexity of General Graph Factor Problems
cites work: An extension of Tutte's 1-factor theorem
cites work: On matroids induced by packing subgraphs
cites work: Efficient subgraphs packing
cites work: Subgraphs with prescribed valencies
cites work: Some Generalizations of the Problem of Distinct Representatives
cites work: Q4288148
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: The Factors of Graphs
DOI: 10.1007/S00373-010-0906-0
Recommended article: Graph packings
Recommended article: Q4340018
Recommended article: Q3795701
Recommended article: Packing parameters in graphs
Recommended article: THE GRAPH-BIN PACKING PROBLEM
Recommended article: Packings in complete graphs
Recommended article: Packing of graphs - a survey
Recommended article: Packing problems in edge-colored graphs
Recommended article: Independent packings in structured graphs
Recommended article: Packing graphs in their complements
description: scientific article; zbMATH DE number 5815428