Hamiltonicity in balanced \(k\)-partite graphs (Q1900517): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamiltonian bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01793008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W167540395 / rank
 
Normal rank

Latest revision as of 11:01, 30 July 2024

scientific article
Language Label Description Also known as
English
Hamiltonicity in balanced \(k\)-partite graphs
scientific article

    Statements

    Hamiltonicity in balanced \(k\)-partite graphs (English)
    0 references
    29 November 1995
    0 references
    Let \(G\) denote a balanced \(k\)-partite graph with \(kn\) nodes. The authors show that \(G\) contains a hamiltonian cycle if its minimum node-degree exceeds \((k/2- 1/(k+ 1))n\) or \((k/2- 2/(k+ 2))n\), according as \(k\) is odd or even.
    0 references
    hamiltonicity
    0 references
    balanced \(k\)-partite graph
    0 references
    hamiltonian cycle
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers