Heinz Adolf Jung. Degree Bounds for Long Paths and Cycles in k-Connected Graphs. In Helmut Alt, editor, Computational Discrete Mathematics, Advanced Lectures. Volume 2122 of Lecture Notes in Computer Science, pages 56-60, Springer, 2001. [doi]
@inproceedings{Jung01:4,
title = {Degree Bounds for Long Paths and Cycles in k-Connected Graphs},
author = {Heinz Adolf Jung},
year = {2001},
url = {http://link.springer.de/link/service/series/0558/bibs/2122/21220056.htm},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Jung01%3A4},
cites = {0},
citedby = {0},
pages = {56-60},
booktitle = {Computational Discrete Mathematics, Advanced Lectures},
editor = {Helmut Alt},
volume = {2122},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-42775-9},
}