scientific article; zbMATH DE number 6379051

MaRDI QIDQ2933086zbMATH OpenFDO

Authors

Publication date 10 December 2014

Full work available at URL http://mathnet.ru/eng/isu287

zbMATH Keywords

addition of archEulerian graphsmin-cost-max-flowmodification of digraphstransport network

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Increasing digraph arc-connectivity by arc addition, reversal and complement
• Adding and Reversing Arcs in Semicomplete Digraphs
• From few components to an Eulerian graph by adding ARCS
• scientific article; zbMATH DE number 4103110
• Two Arc-Disjoint Paths in Eulerian Digraphs
• scientific article; zbMATH DE number 3946164
• scientific article; zbMATH DE number 5238183
• The extremal sizes of arc-maximal \((k, \ell)\)-digraphs
• Reducibility of Eulerian graphs and digraphs
• On edge addition of altered graphs

This page was built for publication:

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