Characterizing subclasses of cover-incomparability graphs by forbidden subposets

01/10/2018
by   Jan Bok, et al.
0

In this paper we demonstrate that several theorems from Bres and Bres3 do not hold as they are stated. These are the theorems regarding forbidden subposet characterizations of certain classes of cover- incomparability graphs. In this paper we correct a mistake in the main theorem of Bres, reformulate the corresponding statements and present corrected proofs. We further characterize posets whose cover-incomparability graphs are interval graphs and unit interval graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/14/2020

The Interval function, Ptolemaic, distance hereditary, bridged graphs and axiomatic characterizations

In this paper we consider certain types of betweenness axioms on the int...
research
06/13/2022

Signed interval graphs and bigraphs: A generalization of interval graphs and bigraphs

In this paper, we define and characterize signed interval graphs and big...
research
05/09/2018

Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs

A hypergraph H is said to be 1-Sperner if for every two hyperedges the s...
research
10/07/2020

Recognizing (Unit) Interval Graphs by Zigzag Graph Searches

Corneil, Olariu, and Stewart [SODA 1998; SIAM Journal on Discrete Mathem...
research
02/23/2018

On Streaming Algorithms for the Steiner Cycle and Path Cover Problem on Interval Graphs and Falling Platforms in Video Games

We introduce a simplified model for platform game levels with falling pl...
research
05/30/2023

Uniform relations between the Gauss-Legendre nodes and weights

Three different relations between the Legendre nodes and weights are pre...
research
06/18/2023

Isabelle Formalisation of Original Representation Theorems

In a recent paper, new theorems linking apparently unrelated mathematica...

Please sign up or login with your details

Forgot password? Click here to reset