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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2012.03.015 / rank
Normal rank
 
Property / author
 
Property / author: Tudor I. Zamfirescu / rank
Normal rank
 
Property / author
 
Property / author: Tudor I. Zamfirescu / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6236034 / rank
 
Normal rank
Property / zbMATH Keywords
 
lattice graphs
Property / zbMATH Keywords: lattice graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
longest cycles
Property / zbMATH Keywords: longest cycles / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2012.03.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006305199 / 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: Ü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
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2012.03.015 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:59, 9 December 2024

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

    Statements

    Identifiers