Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777220 | Electronic Notes in Discrete Mathematics | 2016 | 4 Pages |
Abstract
An edge-coloured graph G is called properly connected if any two vertices are connected by a path whose edges are properly coloured. The proper connection number of a graph G, denoted by pc(G), is the smallest number of colours that are needed in order to make G properly connected. In this paper we consider sufficient conditions in terms of connectivity and forbidden subgraphs, implying a graph to have proper connection number 2.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Christoph Brause, Trung Duy Doan, Ingo Schiermeyer,