Ladislav Nebesky. Intervals and steps in a connected graph. Discrete Mathematics, 286(1-2):151-156, 2004. [doi]
@article{Nebesky04,
title = {Intervals and steps in a connected graph},
author = {Ladislav Nebesky},
year = {2004},
doi = {10.1016/j.disc.2003.11.056},
url = {http://dx.doi.org/10.1016/j.disc.2003.11.056},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Nebesky04},
cites = {0},
citedby = {0},
journal = {Discrete Mathematics},
volume = {286},
number = {1-2},
pages = {151-156},
}