Proper Connection Of Direct Products

• Autorzy: Richard H. Hammack , Dewey T. Taylor
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

direct product of graphs; proper connection of graphs.

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2017
• Tom: 37
• Numer: 4
• Strony: 1005-1013

Daty

wydano

2017-11-27

otrzymano

2016-03-19

poprawiono

2016-06-08

zaakceptowano

2016-08-22

online

2017-09-02

Twórcy

autor

Richard H. Hammack

• , VA 23284-2014,,

autor

Dewey T. Taylor

• , VA 23284-2014,,

Identyfikatory

DOI

10.7151/dmgt.1976