On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
From MaRDI portal
Publication:3275434
DOI10.4153/CJM-1960-049-6zbMath0096.38002MaRDI QIDQ3275434
Publication date: 1960
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Related Items (75)
The maximum average connectivity among all orientations of a graph ⋮ Checking the admissibility of odd-vertex pairings is hard ⋮ Small degree out‐branchings ⋮ An algorithm for minimum cost arc-connectivity orientations ⋮ Unnamed Item ⋮ Bounds of the longest directed cycle length for minimal strong digraphs ⋮ The multi-tree approach to reliability in distributed networks ⋮ On the Most Imbalanced Orientation of a Graph ⋮ Strong connectivity of polyhedral complexes ⋮ Connectivity of orientations of 3-edge-connected graphs ⋮ Shattering, graph orientations, and connectivity ⋮ On orientations maximizing total arc-connectivity ⋮ Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams ⋮ Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties ⋮ Digraphs with the path‐merging property ⋮ Steiner connectivity problems in hypergraphs ⋮ Complexity of (arc)-connectivity problems involving arc-reversals or deorientations ⋮ The complexity of 2-vertex-connected orientation in mixed graphs ⋮ On reversing arcs to improve arc-connectivity ⋮ Unnamed Item ⋮ On 2-strong connectivity orientations of mixed graphs and related problems ⋮ Characterizations of graphs having orientations satisfying local degree restrictions ⋮ 2-linked graphs ⋮ Improved upper bound on the Frank number of 3-edge-connected graphs ⋮ Constructive characterizations for packing and covering with trees ⋮ On the orientation of graphs and hypergraphs ⋮ Combined connectivity augmentation and orientation problems ⋮ Approximating Minimum Cost Connectivity Orientation and Augmentation ⋮ Graph orientations with set connectivity requirements ⋮ Enumerating \(k\)-arc-connected orientations ⋮ Antisymmetric flows and edge-connectivity ⋮ Unnamed Item ⋮ Eulerian orientations and vertex-connectivity ⋮ Matching with sizes (or scheduling with processing set restrictions) ⋮ Matching with sizes (or scheduling with processing set restrictions) ⋮ Tree-compositions and orientations ⋮ Strongly 2-connected orientations of graphs ⋮ Planar orientations with low out-degree and compaction of adjacency matrices ⋮ Infinite, highly connected digraphs with no two arc-disjoint spanning trees ⋮ Prime orientable graphs ⋮ Orienting Cayley graphs generated by transposition trees ⋮ Imprimitivity index of the adjacency matrix of digraphs ⋮ THE Qn,k,m GRAPH: A COMMON GENERALIZATION OF VARIOUS POPULAR INTERCONNECTION NETWORKS ⋮ Recent results on well-balanced orientations ⋮ Stochastic survivable network design problems: theory and practice ⋮ Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs ⋮ On orienting graphs for connectivity: Projective planes and Halin graphs ⋮ Well-balanced orientations of mixed graphs ⋮ Strong formulations for network design problems with connectivity requirements ⋮ What is on his mind? ⋮ Simultaneous well-balanced orientations of graphs ⋮ Orientations of infinite graphs with prescribed edge-connectivity ⋮ On the most imbalanced orientation of a graph ⋮ Locally self-avoiding Eulerian tours ⋮ Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity ⋮ Eine Reduktionsmethode für den Kantenzusammenhang in Graphen ⋮ The edge-orientation problem and some of its variants on weighted graphs ⋮ On Frank's conjecture on \(k\)-connected orientations ⋮ Edge-connectivity augmentation of graphs over symmetric parity families ⋮ Degree-constrained orientations of embedded graphs ⋮ Minimally 2-edge connected graphs ⋮ On Eulerian orientations of even-degree hypercubes ⋮ Edge-connectivity and edge-disjoint spanning trees ⋮ Upper and lower degree-constrained graph orientation with minimum penalty ⋮ Bounds on path connectivity ⋮ A characterization of weakly four‐connected graphs ⋮ Two‐connected orientations of Eulerian graphs ⋮ Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs ⋮ On the hardness of palletizing bins using FIFO queues ⋮ Tournaments and Semicomplete Digraphs ⋮ Decreasing minimization on M-convex sets: algorithms and applications ⋮ GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE ⋮ On the complexity of finding well-balanced orientations with upper bounds on the out-degrees ⋮ Min-cost-flow preserving bijection between subgraphs and orientations ⋮ Degree-constrained graph orientation: maximum satisfaction and minimum violation
This page was built for publication: On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
