Lexicographic matchings cannot form Hamiltonian cycles (Q1110538): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Revision as of 18:29, 18 June 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
