Eulerian Orientations and Circulations

DOI10.1137/0606065zbMath0576.05046OpenAlexW2038552866MaRDI QIDQ3697049

Kwan Mei-Ko, William R. Pulleyblank

Publication date: 1985

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0606065

zbMATH Keywords

Eulerian graphminimum costEulerian orientationHamilton connected graph

Mathematics Subject Classification ID

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

Related Items (3)

A lower bound for the connectivity of directed Euler tour transformation graphs ⋮ Routing problems: A bibliography ⋮ On the windy postman problem on Eulerian graphs

Cites Work

• Unnamed Item
• Hamiltonicity in (0-1)-polyhedra
• On the orientation of graphs
• Hamiltonicity and combinatorial polyhedra
• A note on k-strongly connected orientations of an undirected graph
• An Algorithm for Submodular Functions on Graphs

This page was built for publication: Eulerian Orientations and Circulations