Problems concerning global connectivity of directed graphs

MaRDI QIDQ2816056zbMATH OpenFDO

Authors Jørgen Bang-Jensen

Publication date 1 July 2016

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

zbMATH Keywords

arc reversalscertificates for \(k\)-strong connectivityconnectivityconnectivity augmentationdigraphsminimum strong spanning subdigraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• scientific article; zbMATH DE number 6424505
• Connectivity in directed hypergraphs
• scientific article; zbMATH DE number 4012656
• The connectivity of directed circulant graphs
• Linear connectivity problems in directed hypergraphs
• A contribution to a problem of directed graphs
• An extremal problem on the connectivity of graphs
• Extremal problems for directed graphs
• Algebraic connectivity of directed graphs

Cited in

(3)

• Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
• ``Global graph problems tend to be intractable
• scientific article; zbMATH DE number 4012656 (Why is no real title available?)

This page was built for publication: Problems concerning global connectivity of directed graphs

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