The double competition multigraph of a digraph
Discrete mathematics & theoretical computer science, Tome 17 (2015-2016) no. 2.

Voir la notice de l'article provenant de la source Episciences

In this article, we introduce the notion of the double competition multigraph of a digraph. We give characterizations of the double competition multigraphs of arbitrary digraphs, loopless digraphs, reflexive digraphs, and acyclic digraphs in terms of edge clique partitions of the multigraphs.
@article{DMTCS_2015_17_2_a5,
     author = {Sano, Yoshio and Park, Jeongmi},
     title = {The double competition multigraph of a digraph},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {17},
     number = {2},
     year = {2015-2016},
     doi = {10.46298/dmtcs.2133},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2133/}
}
TY  - JOUR
AU  - Sano, Yoshio
AU  - Park, Jeongmi
TI  - The double competition multigraph of a digraph
JO  - Discrete mathematics & theoretical computer science
PY  - 2015-2016
VL  - 17
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2133/
DO  - 10.46298/dmtcs.2133
LA  - en
ID  - DMTCS_2015_17_2_a5
ER  - 
%0 Journal Article
%A Sano, Yoshio
%A Park, Jeongmi
%T The double competition multigraph of a digraph
%J Discrete mathematics & theoretical computer science
%D 2015-2016
%V 17
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2133/
%R 10.46298/dmtcs.2133
%G en
%F DMTCS_2015_17_2_a5
Sano, Yoshio; Park, Jeongmi. The double competition multigraph of a digraph. Discrete mathematics & theoretical computer science, Tome 17 (2015-2016) no. 2. doi : 10.46298/dmtcs.2133. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2133/

Cité par Sources :