Hamiltonian cycles in <i>n</i>‐extendable graphs (Q4539871): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Long cycles in graphs with large degree sums / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Degree sums, \(k\)-factors and Hamilton cycles in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Maximal Circuits in Finite Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hamiltonian results inK1,3-free graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Note on Hamilton Circuits / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On n-extendable graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The binding number of a graph and its Anderson number / rank | |||
Normal rank |
Latest revision as of 11:41, 4 June 2024
scientific article; zbMATH DE number 1766392
Language | Label | Description | Also known as |
---|---|---|---|
English | Hamiltonian cycles in <i>n</i>‐extendable graphs |
scientific article; zbMATH DE number 1766392 |
Statements
Hamiltonian cycles in <i>n</i>‐extendable graphs (English)
0 references
11 July 2002
0 references
Hamiltonian cycles
0 references
degree sum
0 references
perfect matching
0 references
\(n\)-extendable graph
0 references