Testing Eulerianity and connectivity in directed sparse graphs
From MaRDI portal
Publication:653336
DOI10.1016/j.tcs.2011.06.038zbMath1238.05110MaRDI QIDQ653336
Publication date: 9 January 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.06.038
05C20: Directed graphs (digraphs), tournaments