Lexicographic matchings cannot form Hamiltonian cycles (Q1110538): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q344440 |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Robert E. Woodrow / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lexicographic matching in Boolean algebras / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two Hamilton cycles in bipartite reflective Kneser graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Explicit matchings in the middle levels of the Boolean lattice / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf00337620 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1968184858 / rank | |||
Normal rank |
Latest revision as of 10:00, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Lexicographic matchings cannot form Hamiltonian cycles |
scientific article |
Statements
Lexicographic matchings cannot form Hamiltonian cycles (English)
0 references
1988
0 references
bipartite graph
0 references
Hamiltonian cycle
0 references
lexicographic matchings
0 references