Non-separable detachments of graphs
From MaRDI portal
Publication:1403909
DOI10.1016/S0095-8956(02)00026-6zbMath1029.05086MaRDI QIDQ1403909
Publication date: 20 August 2003
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0095-8956(02)00026-6
Related Items
A detachment algorithm for inferring a graph from path frequency, Enumeration of the degree sequences of non-separable graphs and connected graphs, Independence free graphs and vertex connectivity augmentation, Multiply balanced edge colorings of multigraphs
Cites Work