A Theorem on Graphs, with an Application to a Problem of Traffic Control

Cited In (only showing first 100 items - show all)

On optimal orientations of complete tripartite graphs
Oriented diameter of maximal outerplanar graphs
Cell rotation graphs of strongly connected orientations of plane graphs with an application
Shattering, graph orientations, and connectivity
Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case
Orienting graphs to optimize reachability
Approximation algorithms for orienting mixed graphs
Approximation algorithms for orienting mixed graphs
On the complexity of finding well-balanced orientations with upper bounds on the out-degrees
Path-driven orientation of mixed graphs
Edge-orders
Minimally strong digraphs
The orientation number of two complete graphs with linkages
Greedy rectilinear drawings
On the most imbalanced orientation of a graph
Torelli theorem for graphs and tropical curves
On the most imbalanced orientation of a graph
On orientations maximizing total arc-connectivity
Improved bounds for the oriented radius of mixed multigraphs
On optimal orientations of Cartesian products of graphs. I
The complexity of 2-vertex-connected orientation in mixed graphs
On optimal orientation of cycle vertex multiplications
Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity
On orientations and shortest paths
Strong Formulations for 2-Node-Connected Steiner Network Problems
On the orientation of graphs and hypergraphs
Diameter three orientability of bipartite graphs
On the optimal strongly connected orientations of city street graphs. IV: Four east-west avenues or north-south streets
Characterizations of graphs having orientations satisfying local degree restrictions
Optimal oriented diameter of graphs with diameter 3
Path-based depth-first search for strong and biconnected components
Prime orientable graphs
Max-balanced flows in oriented matroids
Optimal orientations of products of paths and cycles
On a relation between the domination number and a strongly connected bidirection of an undirected graph
Problems on one way road networks
Oriented diameter of graphs with given girth and maximum degree
The number of nowhere-zero flows on graphs and signed graphs
Algorithms for graphs with small octopus
On optimal orientations of Cartesian products with a bipartite graph
Improved bound on the oriented diameter of graphs with given minimum degree
Extremal \(H\)-colorings of trees and 2-connected graphs
The diameter of strong orientations of strong products of graphs
Simultaneous well-balanced orientations of graphs
Strongly 2-connected orientations of graphs
Digraphs with real and Gaussian spectra
The edge-orientation problem and some of its variants on weighted graphs
The minimum diameter of orientations of complete multipartite graphs
What is on his mind?
On a conjecture concerning the orientation number of a graph
Optimal orientations of strong products of paths
Distances in orientations of graphs
Simulated annealing and tabu search approaches to unidirectional flowpath design for automated guided vehicle systems
Optimal orientations of vertex-multiplications of Cartesian products of graphs
Oriented diameter of star graphs
GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE
Orientations with single source and sink
Imprimitivity index of the adjacency matrix of digraphs
A tight lower bound for planar Steiner orientation
A role for doubly stochastic matrices in graph theory
AT-free graphs: Linear bounds for the oriented diameter
The diameter of strong orientations of Cartesian products of graphs
Orientations of infinite graphs with prescribed edge-connectivity
Title not available (Why is that?)
Minimizing and maximizing the diameter in orientations of graphs
Strongly connected multivariate digraphs
Reaching a consensus with limited information
Algebraic models for two-edgeconnected graphs
Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
On oriented diameter of \((n, k)\)-star graphs
Obstructions for acyclic local tournament orientation completions
A degree condition for diameter two orientability of graphs
Strongly connectable digraphs and non-transitive dice
Min-cost-flow preserving bijection between subgraphs and orientations
Lexicographic orientation algorithms
An improvement to Chvátal and Thomassen's upper bound for oriented diameter
A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
Title not available (Why is that?)
Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs
On Frank's conjecture on \(k\)-connected orientations
The maximum average connectivity among all orientations of a graph
A matheuristic approach for solving the 2-connected dominating set problem
Acyclic total dominating sets in cubic graphs
Basic Terminology, Notation and Results
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams
Title not available (Why is that?)
Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs
A formal methods approach to predicting new features of the eukaryotic vesicle traffic system
Small separations in pinch-graphic matroids
One-way trail orientations
Competition-reachability of a graph
Augmenting weighted graphs to establish directed point-to-point connectivity
Model and methods to address urban road network problems with disruptions
Constant delay lattice train schedules
Interpolation theorem for a continuous function on orientations of a simple graph
Coloring graphs to produce properly colored walks
A general formula for the index of depth stability of edge ideals
Graphs with many strong orientations
Large girth and small oriented diameter graphs

This page was built for publication: A Theorem on Graphs, with an Application to a Problem of Traffic Control

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