DeepAI AI Chat
Log In Sign Up

Complexity results for the proper disconnection of graphs

by   You Chen, et al.
Nankai University
Tencent QQ
NetEase, Inc

For an edge-colored graph G, a set F of edges of G is called a proper edge-cut if F is an edge-cut of G and any pair of adjacent edges in F are assigned by different colors. An edge-colored graph is called proper disconnected if for each pair of distinct vertices of G there exists a proper edge-cut separating them. For a connected graph G, the proper disconnection number of G, denoted by pd(G), is defined as the minimum number of colors that are needed to make G proper disconnected. In this paper, we first show that it is NP-complete to decide whether a given k-edge-colored graph G with Δ(G)=4 is proper disconnected. Then, for a graph G with Δ(G)≤ 3 we show that pd(G)≤ 2 and determine the graphs with pd(G)=1 and 2, respectively. Finally, we show that for a general graph G, deciding whether pd(G)=1 is NP-complete, even if G is bipartite.


page 1

page 2

page 3

page 4


Strong rainbow disconnection in graphs

Let G be a nontrivial edge-colored connected graph. An edge-cut R of G i...

Hardness results for rainbow disconnection of graphs

Let G be a nontrivial connected, edge-colored graph. An edge-cut S of G ...

Königsberg Sightseeing: Eulerian Walks in Temporal Graphs

An Eulerian walk (or Eulerian trail) is a walk (resp. trail) that visits...

On the semi-proper orientations of graphs

A semi-proper orientation of a given graph G is a function (D,w) that a...

Adding an Edge in a P_4-sparse Graph

The minimum completion (fill-in) problem is defined as follows: Given a ...

On the Dominant of the Multicut Polytope

Given a graph G=(V,E) and a set S ⊆V2 of terminal pairs, the minimum mul...

Generalising the achromatic number to Zaslavsky's colourings of signed graphs

The chromatic number, which refers to the minimum number of colours requ...