Proper Connection Of Direct Products
Discussiones Mathematicae. Graph Theory, Tome 37 (2017) no. 4, pp. 1005-1013

Voir la notice de l'article provenant de la source Library of Science

The proper connection number of a graph is the least integer k for which the graph has an edge coloring with k colors, with the property that any two vertices are joined by a properly colored path. We prove that given two connected non-bipartite graphs, one of which is (vertex) 2-connected, the proper connection number of their direct product is 2.
Keywords: direct product of graphs, proper connection of graphs
@article{DMGT_2017_37_4_a10,
     author = {Hammack, Richard H. and Taylor, Dewey T.},
     title = {Proper {Connection} {Of} {Direct} {Products}},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {1005--1013},
     publisher = {mathdoc},
     volume = {37},
     number = {4},
     year = {2017},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2017_37_4_a10/}
}
TY  - JOUR
AU  - Hammack, Richard H.
AU  - Taylor, Dewey T.
TI  - Proper Connection Of Direct Products
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2017
SP  - 1005
EP  - 1013
VL  - 37
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2017_37_4_a10/
LA  - en
ID  - DMGT_2017_37_4_a10
ER  - 
%0 Journal Article
%A Hammack, Richard H.
%A Taylor, Dewey T.
%T Proper Connection Of Direct Products
%J Discussiones Mathematicae. Graph Theory
%D 2017
%P 1005-1013
%V 37
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2017_37_4_a10/
%G en
%F DMGT_2017_37_4_a10
Hammack, Richard H.; Taylor, Dewey T. Proper Connection Of Direct Products. Discussiones Mathematicae. Graph Theory, Tome 37 (2017) no. 4, pp. 1005-1013. http://geodesic.mathdoc.fr/item/DMGT_2017_37_4_a10/