A note on mixed graphs and directed splitting off

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199804)27:4<213::AID-JGT2>3.0.CO;2-Q" /><213::AID-JGT2>3.0.CO;2-Q 10.1002/(SICI)1097-0118(199804)27:4<213::AID-JGT2>3.0.CO;2-QzbMath0919.05023OpenAlexW4230708142MaRDI QIDQ4242949

Steffen Enni

Publication date: 31 August 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199804)27:4<213::aid-jgt2>3.0.co;2-q

zbMATH Keywords

augmentationdigraphsorientationsedge-connectivitymixed graphssplitting off

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Recent results on well-balanced orientations ⋮ Graph connectivity and its augmentation: Applications of MA orderings

This page was built for publication: A note on mixed graphs and directed splitting off