Abstract
A nearly sharp lower bound on the length of the longest trail in a graph on n vertices and average degree k is given provided the graph is dense enough (k ≥ 12.5).
[1] Catlin P.A., Super-Eulerian graphs: a survey, J. Graph Theory, 1992, 16(2), 177–196 http://dx.doi.org/10.1002/jgt.319016020910.1002/jgt.3190160209Search in Google Scholar
[2] Erdős P., Gallai T., On maximal paths and circuits of graphs, Acta Math. Acad. Sci. Hungar., 1959, 10(3–4), 337–356 http://dx.doi.org/10.1007/BF0202449810.1007/BF02024498Search in Google Scholar
[3] Faudree R.J., Schelp R.H., Path connected graphs, Acta Math. Acad. Sci. Hungar., 1974, 25(3–4), 313–319 http://dx.doi.org/10.1007/BF0188609010.1007/BF01886090Search in Google Scholar
© 2013 Versita Warsaw
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.
