Complete Edge-Colored Permutation Graphs

by   Tom Hartmann, et al.

We introduce the concept of complete edge-colored permutation graphs as complete graphs that are the edge-disjoint union of "classical" permutation graphs. We show that a graph G=(V,E) is a complete edge-colored permutation graph if and only if each monochromatic subgraph of G is a "classical" permutation graph and G does not contain a triangle withΒ 3 different colors. Using the modular decomposition as a framework we demonstrate that complete edge-colored permutation graphs are characterized in terms of their strong prime modules, which induce also complete edge-colored permutation graphs. This leads to an π’ͺ(|V|^2)-time recognition algorithm. We show, moreover, that complete edge-colored permutation graphs form a superclass of so-called symbolic ultrametrics and that the coloring of such graphs is always a Gallai coloring.


page 1

page 2

page 3

page 4

βˆ™ 12/03/2019

On the deficiency of complete multipartite graphs

An edge-coloring of a graph G with colors 1,...,t is an interval t-color...
βˆ™ 03/26/2020

A Blind Permutation Similarity Algorithm

This paper introduces a polynomial blind algorithm that determines when ...
βˆ™ 12/28/2018

Characterizing Watermark Numbers encoded as Reducible Permutation Graphs against Malicious Attacks

In the domain of software watermarking, we have proposed several graph t...
βˆ™ 12/21/2017

Encoding Watermark Numbers as Reducible Permutation Graphs using Self-inverting Permutations

Several graph theoretic watermark methods have been proposed to encode n...
βˆ™ 05/15/2020

Propagation time for weighted zero forcing

Zero forcing is a graph coloring process that was defined as a tool for ...
βˆ™ 04/02/2021

Permutation-Invariant Subgraph Discovery

We introduce Permutation and Structured Perturbation Inference (PSPI), a...
βˆ™ 05/25/2019

Properly colored C_4's in edge-colored graphs

When many colors appear in edge-colored graphs, it is only natural to ex...