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

Cited in

(only showing first 100 items - show all)

On a relation between the domination number and a strongly connected bidirection of an undirected graph
On a conjecture concerning the orientation number of a graph
Orientations with single source and sink
On orientations and shortest paths
Digraphs with real and Gaussian spectra
Distances in orientations of graphs
Algebraic models for two-edgeconnected graphs
On the optimal strongly connected orientations of city street graphs. IV: Four east-west avenues or north-south streets
Simulated annealing and tabu search approaches to unidirectional flowpath design for automated guided vehicle systems
Minimizing and maximizing the diameter in orientations of graphs
Max-balanced flows in oriented matroids
Optimal orientations of products of paths and cycles
Cell rotation graphs of strongly connected orientations of plane graphs with an application
On the orientation of graphs and hypergraphs
Algorithms for graphs with small octopus
On the forced unilateral orientation number of a graph
On optimal orientations of Cartesian products of graphs. I
The diameter of strong orientations of Cartesian products of graphs
Coloring graphs to produce properly colored walks
A degree condition for diameter two orientability of graphs
Edge-orders
AT-free graphs: Linear bounds for the oriented diameter
Strong connectivity of polyhedral complexes
Route-enabling graph orientation problems
On optimal orientations of Cartesian products with a bipartite graph
A tight lower bound for planar Steiner orientation
A formal methods approach to predicting new features of the eukaryotic vesicle traffic system
Diameter three orientability of bipartite graphs
Upper and lower degree-constrained graph orientation with minimum penalty
Obstructions for acyclic local tournament orientation completions
On the complexity of finding well-balanced orientations with upper bounds on the out-degrees
Min-cost-flow preserving bijection between subgraphs and orientations
The maximum average connectivity among all orientations of a graph
Optimal oriented diameter of graphs with diameter 3
An improvement to Chvátal and Thomassen's upper bound for oriented diameter
Prime orientable graphs
Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs
On Frank's conjecture on \(k\)-connected orientations
Augmenting weighted graphs to establish directed point-to-point connectivity
A heuristic approach for dividing graphs into bi-connected components with a size constraint
A column generation approach for the strong network orientation problem
A possible optimal design of one-way Hamming network \(H(n,3)\) based on the minimum transmission latency
Tree-compositions and orientations
Competition-reachability of a graph
Simultaneous well-balanced orientations of graphs
The edge-orientation problem and some of its variants on weighted graphs
The minimum diameter of orientations of complete multipartite graphs
On optimal orientation of cycle vertex multiplications
Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
Connectivity of orientations of 3-edge-connected graphs
Oriented diameter of graphs with given girth and maximum degree
Graphs with many strong orientations
Directing Road Networks by Listing Strong Orientations
Orienting graphs to optimize reachability
Path-based depth-first search for strong and biconnected components
Approximation algorithms for orienting mixed graphs
A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
Basic Terminology, Notation and Results
Lexicographic orientation algorithms
On the most imbalanced orientation of a graph
Improved bound on the oriented diameter of graphs with given minimum degree
Boundary-type sets of strong product of directed graphs
On some unary algebras and their subalgebra lattices
GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE
Extremal \(H\)-colorings of trees and 2-connected graphs
Approximation algorithms for orienting mixed graphs
Shattering, graph orientations, and connectivity
Characterizations of graphs having orientations satisfying local degree restrictions
Interpolation theorem for a continuous function on orientations of a simple graph
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
Strongly 2-connected orientations of graphs
Path-driven orientation of mixed graphs
Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case
A matheuristic approach for solving the 2-connected dominating set problem
On \(\mathbb{Z}\)-flow-continuous maps and oriented colorings of cubic graphs
On optimal orientations of complete tripartite graphs
One-way trail orientations
Acyclic total dominating sets in cubic graphs
Imprimitivity index of the adjacency matrix of digraphs
Disjoint dijoins for classes of dicuts in finite and infinite digraphs
scientific article; zbMATH DE number 7641244 (Why is no real title available?)
Problems on one way road networks
Optimal orientations of subgraphs of complete bipartite graphs
Strongly connectable digraphs and non-transitive dice
The diameter of strong orientations of strong products of graphs
Optimal orientations of strong products of paths
Strongly connected multivariate digraphs
Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs
Strong Formulations for 2-Node-Connected Steiner Network Problems
The orientation number of two complete graphs with linkages
Minimally strong digraphs
A role for doubly stochastic matrices in graph theory
Optimal orientations of vertex-multiplications of Cartesian products of graphs
Orientations of infinite graphs with prescribed edge-connectivity
Metric dimension: from graphs to oriented graphs
Metric dimension: from graphs to oriented graphs
Greedy rectilinear drawings
Improved bounds for the oriented radius of mixed multigraphs
On orientations maximizing total arc-connectivity
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams

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)