\(k\)-factors and Hamilton cycles in graphs (Q884893): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Zhi Guo Wang / rank
Normal rank
 
Property / author
 
Property / author: Zhi Guo Wang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10114-005-0905-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2095336287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / 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: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Maximal Circuits in Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3971997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long cycles in graphs with large degree sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3703923 / 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 20:50, 25 June 2024

scientific article
Language Label Description Also known as
English
\(k\)-factors and Hamilton cycles in graphs
scientific article

    Statements

    \(k\)-factors and Hamilton cycles in graphs (English)
    0 references
    0 references
    0 references
    7 June 2007
    0 references
    0 references
    \(k\)-factor
    0 references
    2-connected graph
    0 references
    Hamilton cycle
    0 references
    0 references