Packing subgraphs in a graph
type: Item
instance of: scholarly article
title: Packing subgraphs in a graph
zbMATH Open document ID: 0488.90070
DOI: 10.1016/0167-6377(82)90016-5
published in: Operations Research Letters
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 52C17
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3769365
zbMATH Keywords: matching
zbMATH Keywords: triangle packing
zbMATH Keywords: clique packing
zbMATH Keywords: hypomatchable critical graph
zbMATH Keywords: polynomial algorithm
zbMATH Keywords: matching matroid
zbMATH Keywords: node partition
author: Gérard Cornuéjols
author: David Hartvigsen
author: William R. Pulleyblank
MaRDI profile type: Publication
full work available at URL: 0167-6377(82)90016-5
OpenAlex ID: W2067665587
cites work: Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem
cites work: Paths, Trees, and Flowers
cites work: Q4198056
cites work: Q4078069
description: scientific article; zbMATH DE number 3769365