Two‐connected orientations of Eulerian graphs

DOI10.1002/JGT.20158MaRDI QIDQ5486276zbMATH OpenOpenAlexFDO

Authors Alex R. Berg, Tibor Jordán

Publication date 6 September 2006

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.20158

zbMATH Keywords

orientationEulerian graphconnectivity of graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Connectivity (05C40)

Recommendations

• Strongly 2-connected orientations of graphs
• Graphs for which all strong orientations are Eulerian
• Eulerian orientations and vertex-connectivity
• A characterization of weakly four‐connected graphs
• A charcterization of 4‐edge‐connected eulerian graphs

Cites work

• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs

Cited in

(14)

• A characterization of weakly four‐connected graphs
• On the Euler genus of a 2-connected graph
• Graphs for which all strong orientations are Eulerian
• Simultaneous well-balanced orientations of graphs
• Packing of rigid spanning subgraphs and spanning trees
• Eulerian orientations and vertex-connectivity
• On Frank's conjecture on \(k\)-connected orientations
• What is on his mind?
• Sparse connectivity certificates via MA orderings in graphs
• On orienting graphs for connectivity: Projective planes and Halin graphs
• Good acyclic orientations of 4‐regular 4‐connected graphs
• On orientations maximizing total arc-connectivity
• Strongly 2-connected orientations of graphs
• Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams

This page was built for publication: Two‐connected orientations of Eulerian graphs

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