Skip to Main content Skip to Navigation

On the (di)graphs with (directed) proper connection number two

Guillaume Ducoffe 1 Ruxandra Marinescu-Ghemeci 2 Alexandru Popa 2
1 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : A properly connected coloring of a given graph G is one that ensures that every two vertices are the ends of a properly colored path. The proper connection number of G is the minimum number of colors in such a coloring. We study the proper connection number for edge and vertex colorings, in undirected and directed graphs, respectively. More precisely, we initiate the study of the complexity of computing these four parameters. First we disprove some conjectures of Magnant et al. (2016) on characterizing the strong digraphs with proper arc connection number at most two. We prove that deciding whether a given digraph has proper arc connection number at most two is NP-complete. Furthermore, we show there are infinitely many such digraphs with no even-length dicycle. To the best of our knowledge, the proper vertex connection number of digraphs has not been studied before. We initiate the study of proper vertex connectivity in digraphs and we prove similar results as for the arc version. Finally, on a more positive side we present polynomial-time recognition algorithms for bounded-treewidth graphs and bipartite graphs with proper edge connection number at most two.
Complete list of metadatas
Contributor : Guillaume Ducoffe <>
Submitted on : Thursday, March 16, 2017 - 2:02:17 PM
Last modification on : Tuesday, May 26, 2020 - 6:50:53 PM
Document(s) archivé(s) le : Saturday, June 17, 2017 - 2:42:49 PM


Files produced by the author(s)


  • HAL Id : hal-01491146, version 1



Guillaume Ducoffe, Ruxandra Marinescu-Ghemeci, Alexandru Popa. On the (di)graphs with (directed) proper connection number two. [Research Report] Université Côte d’Azur, Inria, CNRS, I3S, France; University of Bucharest, Faculty of Mathematics and Computer Science; National Institute for Research and Development in Informatics, Romania; The Research Institute of the University of Bucharest ICUB, Romania. 2017. ⟨hal-01491146⟩



Record views


Files downloads