Highly non-concurrent longest cycles in lattice graphs (Q383750): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Planar lattice graphs with Gallai's property / 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: Highly non-concurrent longest paths in lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gallai's property for graphs in lattices on the torus and the Möbius strip / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146745 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4775880 / 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
Property / cites work
 
Property / cites work: Q3159270 / rank
 
Normal rank

Revision as of 02:54, 7 July 2024

scientific article
Language Label Description Also known as
English
Highly non-concurrent longest cycles in lattice graphs
scientific article

    Statements

    Highly non-concurrent longest cycles in lattice graphs (English)
    0 references
    0 references
    0 references
    6 December 2013
    0 references
    lattice graphs
    0 references
    longest cycles
    0 references

    Identifiers