An Efficient Algorithm to Test Forcibly-connectedness of Graphical Degree Sequences
From MaRDI portal
Publication:5225547
DOI10.20429/tag.2018.050202zbMath1416.05073arXiv1803.00673WikidataQ129130847 ScholiaQ129130847MaRDI QIDQ5225547
No author found.
Publication date: 22 July 2019
Published in: Theory and Applications of Graphs (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.00673