Computing Tutte Paths (Q5002780): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning planar subgraphs of graphs in the torus and Klein bottle / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on paths in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On longest cycles in essentially 4-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longer cycles in essentially 4-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-walks in circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4842716 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3412151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hamiltonian Circuit Problem is Polynomial for 4-Connected Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5555548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4014627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton cycles in plane triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: 4-connected projective-planar graphs are Hamiltonian-connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on greedy embeddings in metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-trees with few vertices of degree 3 in circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5500371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-edge-Hamiltonian-connectedness of 4-connected plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamilton cycles in certain planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3129827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing 2-Walks in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple test on 2-vertex- and 2-edge-connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: 4-connected projective planar graphs are Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Five-connected toroidal graphs are Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton paths in toroidal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on paths in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bridges and Hamiltonian circuits in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint paths, planarizing cycles, and spanning walks / rank
 
Normal rank

Revision as of 06:45, 26 July 2024

scientific article; zbMATH DE number 7376025
Language Label Description Also known as
English
Computing Tutte Paths
scientific article; zbMATH DE number 7376025

    Statements

    0 references
    0 references
    28 July 2021
    0 references
    Tutte path
    0 references
    Tutte cycle
    0 references
    2-connected planar graph
    0 references
    Hamiltonian cycle
    0 references
    cs.DS
    0 references
    cs.DM
    0 references
    math.CO
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references