Packing subgraphs in a graph (Q1166429): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(82)90016-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2067665587 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Paths, Trees, and Flowers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4078069 / rank | |||
Normal rank | |||
Latest revision as of 15:14, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Packing subgraphs in a graph |
scientific article |
Statements
Packing subgraphs in a graph (English)
0 references
1982
0 references
matching
0 references
triangle packing
0 references
clique packing
0 references
hypomatchable critical graph
0 references
polynomial algorithm
0 references
matching matroid
0 references
node partition
0 references
0 references
