Circularly compatible ones, D-circularity, and proper circular-arc bigraphs

06/02/2019
by   Martín D. Safe, et al.
0

In 1969, Alan Tucker characterized proper circular-arc graphs as those graphs whose augmented adjacency matrices have the circularly compatible ones property. Moreover, he also found a polynomial-time algorithm for deciding whether any given augmented adjacency matrix has the circularly compatible ones property. These results allowed him to devise the first polynomial-time recognition algorithm for proper circular-arc graphs. However, as Tucker himself remarks, he did not solve the problems of finding a structure theorem and an efficient recognition algorithm for the circularly compatible ones property in arbitrary matrices (i.e., not restricted to augmented adjacency matrices only). In this work, we solve these problems. More precisely, we give a minimal forbidden submatrix characterization for the circularly compatible ones property in arbitrary matrices and a linear-time recognition algorithm for the same property. We derive these results from analogous ones for the related D-circular property. Interestingly, these results lead to a minimal forbidden induced subgraph characterization and a linear-time recognition algorithm for proper circular-arc bigraphs, solving a problem first posed by Basu, Das, Ghosh, and Sen [J. Graph Theory, 73(4):361--376, 2013]. Our findings generalize some known results about D-interval hypergraphs and proper interval bigraphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/30/2020

Precedence thinness in graphs

Interval and proper interval graphs are very well-known graph classes, f...
research
02/02/2022

Modification Problems toward Proper (Helly) Circular-arc Graphs

We present a 9^k· n^O(1)-time algorithm for the proper circular-arc vert...
research
06/27/2022

Recognition and Isomorphism of Proper U-graphs in FPT-time

An H-graph is an intersection graph of connected subgraphs of a suitable...
research
05/29/2020

Structural characterization of some problems on circle and interval graphs

A graph is circle if there is a family of chords in a circle such that t...
research
04/02/2023

Gallai-like characterization of strong cocomparability graphs

Strong cocomparability graphs are the reflexive graphs whose adjacency m...
research
08/30/2021

Extending Partial Representations of Circular-Arc Graphs

The partial representation extension problem generalizes the recognition...
research
03/05/2021

2-nested matrices: towards understanding the structure of circle graphs

A (0,1)-matrix has the consecutive-ones property (C1P) if its columns ca...

Please sign up or login with your details

Forgot password? Click here to reset