Bipartite double cover and perfect 2-matching covered graph with its algorithm (Q2355652): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s11464-015-0449-z / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11464-015-0449-Z / rank | |||
Normal rank | |||
Latest revision as of 04:15, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bipartite double cover and perfect 2-matching covered graph with its algorithm |
scientific article |
Statements
Bipartite double cover and perfect 2-matching covered graph with its algorithm (English)
0 references
24 July 2015
0 references
bipartite double cover
0 references
perfect 2-matching covered graph
0 references
1-extendable graph
0 references
minimally perfect 2-matching covered graph
0 references
minimally 1-extendable graph
0 references
algorithm
0 references
