Bipartite double cover and perfect 2-matching covered graph with its algorithm (Q2355652): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s11464-015-0449-z / rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s11464-015-0449-z / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2135974382 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A general theory of translation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4304325 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matching extension and minimum degree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Regularisable graphs I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3919752 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multiple Kronecker covering graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the structure of minimally \(n\)-extendable bipartite graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matching theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On n-extendable graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3800093 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Factors of Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Double covers of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimal 2-matching-covered graphs / rank | |||
Normal 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