A Theorem on Graphs, with an Application to a Problem of Traffic Control
From MaRDI portal
Publication:5774643
DOI10.2307/2303897zbMath0021.35703OpenAlexW2335132016WikidataQ29030605 ScholiaQ29030605MaRDI QIDQ5774643
Publication date: 1939
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2303897
Related Items (only showing first 100 items - show all)
On the optimal strongly connected orientations of city street graphs. IV: Four east-west avenues or north-south streets ⋮ Augmenting weighted graphs to establish directed point-to-point connectivity ⋮ The maximum average connectivity among all orientations of a graph ⋮ Optimal oriented diameter of graphs with diameter 3 ⋮ Orienting graphs to optimize reachability ⋮ Simulated annealing and tabu search approaches to unidirectional flowpath design for automated guided vehicle systems ⋮ Minimizing and maximizing the diameter in orientations of graphs ⋮ Path-based depth-first search for strong and biconnected components ⋮ Disjoint dijoins for classes of dicuts in finite and infinite digraphs ⋮ Max-balanced flows in oriented matroids ⋮ Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice ⋮ Improved bound on the oriented diameter of graphs with given minimum degree ⋮ Minimally strong digraphs ⋮ The number of nowhere-zero flows on graphs and signed graphs ⋮ Extremal \(H\)-colorings of trees and 2-connected graphs ⋮ On the Most Imbalanced Orientation of a Graph ⋮ Optimal orientations of vertex-multiplications of cartesian products of graphs ⋮ Strong connectivity of polyhedral complexes ⋮ A heuristic approach for dividing graphs into bi-connected components with a size constraint ⋮ On optimal orientations of complete tripartite graphs ⋮ Optimal orientations of products of paths and cycles ⋮ The diameter of strong orientations of Cartesian products of graphs ⋮ Connectivity of orientations of 3-edge-connected graphs ⋮ On orientations and shortest paths ⋮ Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case ⋮ A column generation approach for the strong network orientation problem ⋮ Approximation algorithms for orienting mixed graphs ⋮ Unnamed Item ⋮ Shattering, graph orientations, and connectivity ⋮ Coloring graphs to produce properly colored walks ⋮ Digraphs with real and Gaussian spectra ⋮ A possible optimal design of one-way Hamming network \(H(n,3)\) based on the minimum transmission latency ⋮ Route-enabling graph orientation problems ⋮ Oriented diameter of graphs with given girth and maximum degree ⋮ Unnamed Item ⋮ Characterizations of graphs having orientations satisfying local degree restrictions ⋮ Cell rotation graphs of strongly connected orientations of plane graphs with an application ⋮ On the orientation of graphs and hypergraphs ⋮ A role for doubly stochastic matrices in graph theory ⋮ Algorithms for graphs with small octopus ⋮ On optimal orientations of Cartesian products with a bipartite graph ⋮ Problems on One Way Road Networks ⋮ Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs ⋮ Tree-compositions and orientations ⋮ Strongly 2-connected orientations of graphs ⋮ A degree condition for diameter two orientability of graphs ⋮ Path-driven orientation of mixed graphs ⋮ An improvement to Chvátal and Thomassen's upper bound for oriented diameter ⋮ Unnamed Item ⋮ Oriented diameter of star graphs ⋮ Prime orientable graphs ⋮ Edge-orders ⋮ Imprimitivity index of the adjacency matrix of digraphs ⋮ Strongly connectable digraphs and non-transitive dice ⋮ Approximation Algorithms for Orienting Mixed Graphs ⋮ Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs ⋮ Strongly connected multivariate digraphs ⋮ The diameter of strong orientations of strong products of graphs ⋮ Unnamed Item ⋮ A tight lower bound for planar Steiner orientation ⋮ Competition-reachability of a graph ⋮ Torelli theorem for graphs and tropical curves ⋮ Distances in orientations of graphs ⋮ The orientation number of two complete graphs with linkages ⋮ What is on his mind? ⋮ Algebraic models for two-edgeconnected graphs ⋮ Simultaneous well-balanced orientations of graphs ⋮ A formal methods approach to predicting new features of the eukaryotic vesicle traffic system ⋮ A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation ⋮ Orientations of infinite graphs with prescribed edge-connectivity ⋮ On the most imbalanced orientation of a graph ⋮ Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity ⋮ Optimal orientations of strong products of paths ⋮ Diameter three orientability of bipartite graphs ⋮ The edge-orientation problem and some of its variants on weighted graphs ⋮ On Frank's conjecture on \(k\)-connected orientations ⋮ On a relation between the domination number and a strongly connected bidirection of an undirected graph ⋮ Minimum-cost strong network orientation problems: Classification, complexity, and algorithms ⋮ Graphs with Many Strong Orientations ⋮ Directing Road Networks by Listing Strong Orientations ⋮ Boundary-type sets of strong product of directed graphs ⋮ On a conjecture concerning the orientation number of a graph ⋮ Upper and lower degree-constrained graph orientation with minimum penalty ⋮ Unnamed Item ⋮ A matheuristic approach for solving the 2-connected dominating set problem ⋮ AT-free graphs: Linear bounds for the oriented diameter ⋮ The minimum diameter of orientations of complete multipartite graphs ⋮ On optimal orientation of cycle vertex multiplications ⋮ Basic Terminology, Notation and Results ⋮ Lexicographic Orientation Algorithms ⋮ On the forced unilateral orientation number of a graph ⋮ On optimal orientations of Cartesian products of graphs. I ⋮ Strong Formulations for 2-Node-Connected Steiner Network Problems ⋮ Orientations with single source and sink ⋮ Obstructions for acyclic local tournament orientation completions ⋮ 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 ⋮ Interpolation theorem for a continuous function on orientations of a simple graph ⋮ Acyclic total dominating sets in cubic graphs
This page was built for publication: A Theorem on Graphs, with an Application to a Problem of Traffic Control
