Non-separable detachments of graphs

DOI10.1016/S0095-8956(02)00026-6zbMath1029.05086OpenAlexW2049897171MaRDI QIDQ1403909

Bill Jackson, Tibor Jordán

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

zbMATH Keywords

edge-connectivitydetachmentdegree specification

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Related Items (4)

Multiply balanced edge colorings of multigraphs ⋮ Independence free graphs and vertex connectivity augmentation ⋮ A detachment algorithm for inferring a graph from path frequency ⋮ Enumeration of the degree sequences of non-separable graphs and connected graphs

Cites Work

• Unnamed Item
• Connected Detachments of Graphs and Generalized Euler Trails
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I

This page was built for publication: Non-separable detachments of graphs