On the minimal length of the longest trail in a fixed edge-density graph

DOI10.2478/S11533-013-0285-XzbMath1277.05089OpenAlexW1987333219MaRDI QIDQ386380

Vajk Szécsi

Publication date: 9 December 2013

Published in: Central European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/s11533-013-0285-x

zbMATH Keywords

pathsextremal graph theorytrails

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Density (toughness, etc.) (05C42)

Related Items (1)

Ramsey numbers of trails and circuits

Cites Work

• On maximal paths and circuits of graphs
• Supereulerian graphs: A survey
• Path connected graphs

This page was built for publication: On the minimal length of the longest trail in a fixed edge-density graph