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
Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués, CRISAM - Inria Sophia Antipolis - Méditerranée
2 University of Bucharest (ROMANIA)
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.
Type de document :
Rapport
[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
Liste complète des métadonnées
https://hal.archives-ouvertes.fr/hal-01491146
Contributeur : Guillaume Ducoffe <>
Soumis le : jeudi 16 mars 2017 - 14:02:17
Dernière modification le : jeudi 7 février 2019 - 14:59:59
Document(s) archivé(s) le : samedi 17 juin 2017 - 14:42:49

Fichier

directed-proper-connectivity.p...
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01491146, version 1

Collections

UNICE | TDS-MACS | INRIA | I3S | LARA | INRIA2017 | UNIV-COTEDAZUR

Citation

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〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

400

Téléchargements de fichiers

208

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD