Graphs such that every two edges are contained in a shortest cycle
From MaRDI portal
Publication:1122590
DOI10.1016/0012-365X(89)90285-9zbMath0676.05054OpenAlexW2042834150MaRDI QIDQ1122590
Publication date: 1989
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(89)90285-9
Related Items (2)
Cites Work
This page was built for publication: Graphs such that every two edges are contained in a shortest cycle