An algebraic framework of weighted directed graphs.
An Algorithm for Scaling Matrices and Computing the Minimum Cycle Mean in a Digraph.
An equational basis in four variables for the three-element tournament
An extremal problem for some classes of oriented graphs
Analogues of cliques for oriented coloring
We examine subgraphs of oriented graphs in the context of oriented coloring that are analogous to cliques in traditional vertex coloring. Bounds on the sizes of these subgraphs are given for planar, outerplanar, and series-parallel graphs. In particular, the main result of the paper is that a planar graph cannot contain an induced subgraph D with more than 36 vertices such that each pair of vertices in D are joined by a directed path of length at most two.
Antidirected Hamilton Circuits and Paths in Tournaments.
Antipodal graphs and digraphs.
Antisymmetric flows and strong colourings of oriented graphs
The homomorphisms of oriented or undirected graphs, the oriented chromatic number, the relationship between acyclic colouring number and oriented chromatic number, have been recently intensely studied. For the purpose of duality, we define the notions of strong-oriented colouring and antisymmetric-flow. An antisymmetric-flow is a flow with values in an additive abelian group which uses no opposite elements of the group. We prove that the strong-oriented chromatic number (as the modular version...
Applications of Shortest Path Algorithms to Matrix Scalings.
Arc-transitive non-Cayley graphs from regular maps.
Area Requirement and Symmetry Display of Planar Upward Drawings.
Asymptotic comparison of two constructions for large digraphs of given degree and diameter
We compare the asymptotic growth of the order of the digraphs arising from a construction of Comellas and Fiol when applied to Faber-Moore digraphs versus plainly the Faber-Moore digraphs for the corresponding degree and diameter.
Automorphism groups of Cayley digraphs of .
Automorphism groups of wreath product digraphs.