A Theorem on Graphs, with an Application to a Problem of Traffic Control
From MaRDI portal
Publication:5774643
Cited in
(only showing first 100 items - show all)- Imprimitivity index of the adjacency matrix of digraphs
- A tight lower bound for planar Steiner orientation
- AT-free graphs: Linear bounds for the oriented diameter
- The diameter of strong orientations of Cartesian products of graphs
- A role for doubly stochastic matrices in graph theory
- A column generation approach for the strong network orientation problem
- Orientations of infinite graphs with prescribed edge-connectivity
- scientific article; zbMATH DE number 7641244 (Why is no real title available?)
- Connectivity of orientations of 3-edge-connected graphs
- On some unary algebras and their subalgebra lattices
- Partially broken orientations of Eulerian graphs on closed surfaces
- Strongly connected multivariate digraphs
- Minimizing and maximizing the diameter in orientations of graphs
- Upper and lower degree-constrained graph orientation with minimum penalty
- On reversing arcs to improve arc-connectivity
- Optimal orientations of subgraphs of complete bipartite graphs
- Algebraic models for two-edgeconnected graphs
- On the forced unilateral orientation number of a graph
- Tree-compositions and orientations
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
- Reaching a consensus with limited information
- A possible optimal design of one-way Hamming network \(H(n,3)\) based on the minimum transmission latency
- Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
- Obstructions for acyclic local tournament orientation completions
- On oriented diameter of \((n, k)\)-star graphs
- Shattering, graph orientations, and connectivity
- Cell rotation graphs of strongly connected orientations of plane graphs with an application
- On optimal orientations of complete tripartite graphs
- A degree condition for diameter two orientability of graphs
- Orienting graphs to optimize reachability
- Oriented diameter of maximal outerplanar graphs
- Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case
- Approximation algorithms for orienting mixed graphs
- Strongly connectable digraphs and non-transitive dice
- On the complexity of finding well-balanced orientations with upper bounds on the out-degrees
- Approximation algorithms for orienting mixed graphs
- Path-driven orientation of mixed graphs
- 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
- Edge-orders
- The orientation number of two complete graphs with linkages
- A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
- Minimally strong digraphs
- On the most imbalanced orientation of a graph
- Torelli theorem for graphs and tropical curves
- On the most imbalanced orientation of a graph
- Greedy rectilinear drawings
- On optimal orientations of Cartesian products of graphs. I
- On orientations maximizing total arc-connectivity
- Improved bounds for the oriented radius of mixed multigraphs
- On optimal orientation of cycle vertex multiplications
- On the number of \(k\)-proper connected edge and vertex colorings of graphs
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity
- The complexity of 2-vertex-connected orientation in mixed graphs
- On orientations and shortest paths
- On the orientation of graphs and hypergraphs
- Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs
- Strong Formulations for 2-Node-Connected Steiner Network Problems
- The maximum average connectivity among all orientations of a graph
- On Frank's conjecture on \(k\)-connected orientations
- On the optimal strongly connected orientations of city street graphs. IV: Four east-west avenues or north-south streets
- Diameter three orientability of bipartite graphs
- Path-based depth-first search for strong and biconnected components
- Characterizations of graphs having orientations satisfying local degree restrictions
- A matheuristic approach for solving the 2-connected dominating set problem
- Optimal oriented diameter of graphs with diameter 3
- Acyclic total dominating sets in cubic graphs
- Basic Terminology, Notation and Results
- 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
- Max-balanced flows in oriented matroids
- Prime orientable graphs
- Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams
- Small separations in pinch-graphic matroids
- Optimal orientations of products of paths and cycles
- Competition-reachability of a graph
- Augmenting weighted graphs to establish directed point-to-point connectivity
- On a relation between the domination number and a strongly connected bidirection of an undirected graph
- One-way trail orientations
- Model and methods to address urban road network problems with disruptions
- The number of nowhere-zero flows on graphs and signed graphs
- Oriented diameter of graphs with given girth and maximum degree
- Problems on one way road networks
- Algorithms for graphs with small octopus
- Interpolation theorem for a continuous function on orientations of a simple graph
- Constant delay lattice train schedules
- Improved bound on the oriented diameter of graphs with given minimum degree
- On optimal orientations of Cartesian products with a bipartite graph
- Extremal \(H\)-colorings of trees and 2-connected graphs
- Coloring graphs to produce properly colored walks
- Simultaneous well-balanced orientations of graphs
- The diameter of strong orientations of strong products of graphs
- Graphs with many strong orientations
- A general formula for the index of depth stability of edge ideals
- Large girth and small oriented diameter graphs
- The strong network orientation problem
- Strongly 2-connected orientations of graphs
- Digraphs with real and Gaussian spectra
- Quest for graphs of Frank number 3
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)