Hamiltonian properties of triangular grid graphs (Q998354): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5501817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3958496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs---a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995846 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Channel assignment and multicolouring of the induced subgraphs of the triangular lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strengthening of Kikustapos;s theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Paths in Grid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every connected, locally connected nontrivial graph with no induced claw is hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4515905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3621130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian cycles in T-graphs / rank
 
Normal rank

Revision as of 01:06, 29 June 2024

scientific article
Language Label Description Also known as
English
Hamiltonian properties of triangular grid graphs
scientific article

    Statements

    Hamiltonian properties of triangular grid graphs (English)
    0 references
    0 references
    0 references
    0 references
    28 January 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    Hamiltonian graph
    0 references
    triangular grid graph
    0 references
    local connectivity
    0 references
    NP-completeness
    0 references
    0 references