1 citations · 1 across the 5 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
math.CO2016
On bipartite mixed graphs
C. Dalfó, M. A. Fiol, N. López
Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are bipartite. As…
math.CO2016
An improved Moore bound for mixed graphs
C. Dalfó, M. A. Fiol, N. López
A mixed graph can contain both (undirected) edges and arcs (directed edges). Here we derive an improved Moore-like bound for the maximum number of vertices of a mixed graph wit…
math.CO2016
Sequence mixed graphs
C. Dalfó, M. A. Fiol, N. López
A mixed graph can be seen as a type of digraph containing some edges (two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both…