Intersecting longest cycles in Archimedean tilings (Q6174817): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2866263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Archimedean tiling graphs with Gallai’s property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding graphs into embedded graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertices missed by longest paths or circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3735714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein planarer hypohamiltonscher Graph mit 57 Knoten / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5016014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2839683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice graphs with non-concurrent longest cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3199444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard combinatorial problems and minor embeddings on lattice graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On longest cycles in grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar lattice graphs with Gallai's property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersecting longest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über längste Wege und Kreise in Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest Sets of Longest Paths with Empty Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly non-concurrent longest cycles in lattice graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146745 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar and infinite hypohamiltonian and hypotraceable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4775880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On planar hypohamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-connected planar graph without concurrent longest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On longest paths and circuits in graphs. / rank
 
Normal rank

Latest revision as of 16:29, 2 August 2024

scientific article; zbMATH DE number 7729246
Language Label Description Also known as
English
Intersecting longest cycles in Archimedean tilings
scientific article; zbMATH DE number 7729246

    Statements

    Intersecting longest cycles in Archimedean tilings (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 August 2023
    0 references
    Gallai's property
    0 references
    embedding of graphs
    0 references
    Archimedean tiling graphs
    0 references
    longest cycles
    0 references

    Identifiers