
On some special classes of contact B_0VPG graphs
A graph G is a B_0VPG graph if one can associate a path on a rectangula...
read it

Testing isomorphism of circulararc graphs in polynomial time
A graph is said to be circulararc if the vertices can be associated wit...
read it

Recognizing Generalized Transmission Graphs of Line Segments and Circular Sectors
Suppose we have an arrangement A of n geometric objects x_1, ..., x_n ⊆R...
read it

On bounds on bend number of split and cocomparability graphs
A path is a simple, piecewise linear curve made up of alternating horizo...
read it

Pentagon contact representations
Representations of planar triangulations as contact graphs of a set of i...
read it

Sequentially estimating the dynamic contact angle of sessile saliva droplets in view of SARSCoV2
Estimating the contact angle of a virus infected saliva droplet is seen ...
read it

Morphing Contact Representations of Graphs
We consider the problem of morphing between contact representations of a...
read it
Characterising circulararc contact B_0VPG graphs
A contact B_0VPG graph is a graph for which there exists a collection of nontrivial pairwise interiorly disjoint horizontal and vertical segments in onetoone correspondence with its vertex set such that two vertices are adjacent if and only if the corresponding segments touch. It was shown by Deniz et al. that Recognition is NPcomplete for contact B_0VPG graphs. In this paper we present a minimal forbidden induced subgraph characterisation of contact B_0VPG graphs within the class of circulararc graphs and provide a polynomialtime algorithm for recognising these graphs.
READ FULL TEXT
Comments
There are no comments yet.