Über längste Wege und Kreise in Graphen

MaRDI QIDQ1225628zbMATH OpenFDO

Authors 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, https://eudml.org/doc/107565

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites work

• A two-connected planar graph without concurrent longest paths
• scientific article; zbMATH DE number 3427394 (Why is no real title available?)
• scientific article; zbMATH DE number 3248752 (Why is no real title available?)
• On longest paths and circuits in graphs.
• Vertices missed by longest paths or circuits
• Ü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

Cited in

(9)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1225628)