Simultaneous well-balanced orientations of graphs

DOI10.1016/j.jctb.2006.01.002zbMath1098.05048OpenAlexW2144468478MaRDI QIDQ2498739

Zoltán Szigeti, Zoltán Király

Publication date: 16 August 2006

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2006.01.002

zbMATH Keywords

connectivityEulerian graph

Mathematics Subject Classification ID

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

Related Items (16)

Packing spanning trees and spanning 2-connected \(k\)-edge-connected essentially \((2k-1)\)-edge-connected subgraphs ⋮ Checking the admissibility of odd-vertex pairings is hard ⋮ Connectivity of orientations of 3-edge-connected graphs ⋮ Extremal \(k\)-forcing sets in oriented graphs ⋮ ON THE VOLUME CONJECTURE FOR CLASSICAL SPIN NETWORKS ⋮ On orientations maximizing total arc-connectivity ⋮ Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams ⋮ Packing of rigid spanning subgraphs and spanning trees ⋮ Complexity of (arc)-connectivity problems involving arc-reversals or deorientations ⋮ Unnamed Item ⋮ Eulerian orientations and vertex-connectivity ⋮ Imprimitivity index of the adjacency matrix of digraphs ⋮ Recent results on well-balanced orientations ⋮ On orienting graphs for connectivity: Projective planes and Halin graphs ⋮ On Frank's conjecture on \(k\)-connected orientations ⋮ On Eulerian orientations of even-degree hypercubes

Cites Work

• Minimale \(n\)-fach kantenzusammenhängende Graphen
• Efficient splitting off algorithms for graphs
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• Two‐connected orientations of Eulerian graphs
• A Theorem on Graphs, with an Application to a Problem of Traffic Control
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Simultaneous well-balanced orientations of graphs