On the complexity of turning a graph into the analogue of a clique - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

On the complexity of turning a graph into the analogue of a clique

Sergey Kirgizov

Résumé

An orientation of an undirected graph G has weak diameter k if, for every pair {u, v} of vertices of G, there is a directed path with length at most k joining u and v in either direction. We show that deciding whether an undirected graph admits an orientation with weak diameter k is NP-complete for every k ≥ 2. This result implies the NP-completeness of deciding whether an undirected graph can be turned into the analogue of a clique for proper colouring of several augmented kinds of graphs.
Fichier non déposé

Dates et versions

hal-02417841 , version 1 (18-12-2019)

Identifiants

  • HAL Id : hal-02417841 , version 1

Citer

Julien Bensmail, Romaric Duvignau, Sergey Kirgizov. On the complexity of turning a graph into the analogue of a clique. 9th International colloquium on graph theory and combinatorics (ICGT 2014), Jun 2014, Grenoble, France. ⟨hal-02417841⟩
24 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More