Edge-connectivities of graphs and digraphs

MaRDI QIDQ2816087zbMATH OpenFDO

Authors András Frank

Publication date 1 July 2016

Full work available at URL http://www.sciencedirect.com/science/article/pii/S157106530580143X?np=y

zbMATH Keywords

edge-connectivity augmentationorientationpacking trees and paths

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Connectivity (05C40)

Cited in

(10)

• On computing a conditional edge-connectivity of a graph
• Edge-pancyclicity of coupled graphs
• Connectivity in graphs and digraphs. Maximizing vertex-, edge- and arc-connectivity with an emphasis on local connectivity properties
• On computing the connectivities of graphs and digraphs
• Connectivity of Imase and Itoh digraphs
• Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
• Testing \(k\)-edge-connectivity of digraphs
• scientific article; zbMATH DE number 2097434 (Why is no real title available?)
• 2-Edge Connectivity in Directed Graphs
• scientific article; zbMATH DE number 5203325 (Why is no real title available?)

This page was built for publication: Edge-connectivities of graphs and digraphs

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