research
∙
08/30/2023
Forbidden patterns of graphs 12-representable by pattern-avoiding words
A graph G = ({1, 2, …, n}, E) is 12-representable if there is a word w o...
share
research
∙
04/15/2023
Computing shortest 12-representants of labeled graphs
The notion of 12-representable graphs was introduced as a variant of a w...
research
∙
11/09/2022
Graph classes equivalent to 12-representable graphs
Jones et al. (2015) introduced the notion of u-representable graphs, whe...
research
∙
07/18/2019
Linear-semiorders and their incomparability graphs
A linear-interval order is the intersection of a linear order and an int...
research
∙
10/15/2018
A recognition algorithm for adjusted interval digraphs
Min orderings give a vertex ordering characterization, common to some gr...
research
∙
10/18/2017
