Simultaneous well-balanced orientations of graphs

DOI10.1016/J.JCTB.2006.01.002MaRDI QIDQ2498739zbMATH OpenOpenAlexFDO

Authors 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) Eulerian and Hamiltonian graphs (05C45) Connectivity (05C40)

Recommendations

• Recent results on well-balanced orientations
• On the complexity of finding well-balanced orientations with upper bounds on the out-degrees
• scientific article; zbMATH DE number 1146228
• On the orientation of graphs and hypergraphs
• An orientation theorem with parity conditions

Cites work

• scientific article; zbMATH DE number 446490 (Why is no real title available?)
• scientific article; zbMATH DE number 3685495 (Why is no real title available?)
• scientific article; zbMATH DE number 863470 (Why is no real title available?)
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• scientific article; zbMATH DE number 3334027 (Why is no real title available?)
• A Theorem on Graphs, with an Application to a Problem of Traffic Control
• Efficient splitting off algorithms for graphs
• Minimale \(n\)-fach kantenzusammenhängende Graphen
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• Two‐connected orientations of Eulerian graphs

Cited in

(19)

• Recent results on well-balanced orientations
• Packing of rigid spanning subgraphs and spanning trees
• On the complexity of finding well-balanced orientations with upper bounds on the out-degrees
• ON THE VOLUME CONJECTURE FOR CLASSICAL SPIN NETWORKS
• Extremal k-forcing sets in oriented graphs
• On orientations maximizing total arc-connectivity
• On Frank's conjecture on \(k\)-connected orientations
• Eulerian orientations and vertex-connectivity
• On orienting graphs for connectivity: Projective planes and Halin graphs
• Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams
• One-way trail orientations
• Checking the admissibility of odd-vertex pairings is hard
• On Eulerian orientations of even-degree hypercubes
• Packing spanning trees and spanning 2-connected \(k\)-edge-connected essentially \((2k-1)\)-edge-connected subgraphs
• On the minimum number of inversions to make a digraph k-(arc-)strong
• Complexity of (arc)-connectivity problems involving arc-reversals or deorientations
• The Nash-Williams orientation theorem for graphs with countably many ends
• Imprimitivity index of the adjacency matrix of digraphs
• Connectivity of orientations of 3-edge-connected graphs

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

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