Solution to an open problem on 4-ordered Hamiltonian graphs (Q442328): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Hamilton connectivity of generalized Petersen graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3636214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5475533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized honeycomb torus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden subgraphs that imply \(k\)-ordered and \(k\)-ordered Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(k\)-ordered bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey of results on \(k\)-ordered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-regular 4-ordered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-ordered Hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3565921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-rainbow domination of generalized Petersen graphs \(P(n,2)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-rainbow domination in generalized petersen graphs \(P(n,3)\) / rank
 
Normal rank

Latest revision as of 13:45, 5 July 2024

scientific article
Language Label Description Also known as
English
Solution to an open problem on 4-ordered Hamiltonian graphs
scientific article

    Statements

    Solution to an open problem on 4-ordered Hamiltonian graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 August 2012
    0 references
    0 references
    generalized Petersen graphs
    0 references
    Hamiltonian
    0 references
    4-ordered
    0 references
    0 references