Non-separable detachments of graphs

DOI10.1016/S0095-8956(02)00026-6MaRDI QIDQ1403909zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Highly edge-connected detachments of graphs and digraphs
• Detachments Preserving Local Edge-Connectivity of Graphs
• Another proof of a theorem concerning detachments of graphs
• Amalgamations of almost regular edge-colourings of simple graphs
• Connected Detachments of Graphs and Generalized Euler Trails
• Fragile graphs with small independent cuts
• The connected cutset connectivity of a graph
• A note on fragile graphs
• Decomposition of a 2-connected graph into three connected subgraphs
• Detachments of Complete Graphs

Cites work

• scientific article; zbMATH DE number 3914375 (Why is no real title available?)
• 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

Cited in

(10)

• Orientations and detachments of graphs with prescribed degrees and connectivity
• Highly edge-connected detachments of graphs and digraphs
• scientific article; zbMATH DE number 842894 (Why is no real title available?)
• Multiply balanced edge colorings of multigraphs
• A detachment algorithm for inferring a graph from path frequency
• Another proof of a theorem concerning detachments of graphs
• Independence free graphs and vertex connectivity augmentation
• Enumeration of the degree sequences of non-separable graphs and connected graphs
• scientific article; zbMATH DE number 3914375 (Why is no real title available?)
• Detachments of Complete Graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1403909)