Über längste Wege und Kreise in Graphen

zbMath0326.05114MaRDI QIDQ1225628

Werner Schmitz

Publication date: 1976

Published in: Rendiconti del Seminario Matematico della Università di Padova (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RSMUP_1975__53__97_0

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (9)

Detour trees ⋮ Gallai's property for graphs in lattices on the torus and the Möbius strip ⋮ Planar lattice graphs with Gallai's property ⋮ Highly non-concurrent longest cycles in lattice graphs ⋮ Intersecting longest paths ⋮ Intersecting longest cycles in Archimedean tilings ⋮ Intersection of longest paths in graph classes ⋮ Gallai's question and constructions of almost hypotraceable graphs ⋮ Nonempty intersection of longest paths in series-parallel graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A two-connected planar graph without concurrent longest paths
• Vertices missed by longest paths or circuits
• On longest paths and circuits in graphs.
• Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen
• Über die Nichtexistenz zweier Knotenpunkte eines Graphen, die alle längsten Kreise fassen

This page was built for publication: Über längste Wege und Kreise in Graphen