Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Takaoka, Asahi"'
Autor:
Takaoka, Asahi
In this paper, we provide a characterization of uniquely representable two-directional orthogonal ray graphs, which are defined as the intersection graphs of rightward and downward rays. The collection of these rays is called a representation of the
Externí odkaz:
http://arxiv.org/abs/2406.06077
Autor:
Takaoka, Asahi
A graph $G = (\{1, 2, \ldots, n\}, E)$ is $12$-representable if there is a word $w$ over $\{1, 2, \ldots, n\}$ such that two vertices $i$ and $j$ with $i < j$ are adjacent if and only if every $j$ occurs before every $i$ in $w$. These graphs have bee
Externí odkaz:
http://arxiv.org/abs/2308.15904
Autor:
Takaoka, Asahi
The notion of $12$-representable graphs was introduced as a variant of a well-known class of word-representable graphs. Recently, these graphs were shown to be equivalent to the complements of simple-triangle graphs. This indicates that a $12$-repres
Externí odkaz:
http://arxiv.org/abs/2304.07507
Autor:
Takaoka, Asahi
Jones et al. (2015) introduced the notion of $u$-representable graphs, where $u$ is a word over $\{1, 2\}$ different from $22\cdots2$, as a generalization of word-representable graphs. Kitaev (2016) showed that if $u$ is of length at least 3, then ev
Externí odkaz:
http://arxiv.org/abs/2211.04871
Autor:
Takaoka, Asahi
A linear-interval order is the intersection of a linear order and an interval order. For this class of orders, several structural results have been known. This paper introduces a new subclass of linear-interval orders. We call a partial order a \emph
Externí odkaz:
http://arxiv.org/abs/1907.07845
Autor:
Takaoka, Asahi
Min orderings give a vertex ordering characterization, common to some graphs and digraphs such as interval graphs, complements of threshold tolerance graphs (known as co-TT graphs), and two-directional orthogonal ray graphs. An adjusted interval digr
Externí odkaz:
http://arxiv.org/abs/1810.06162
Autor:
Takaoka, Asahi
A simple-triangle graph is the intersection graph of triangles that are defined by a point on a horizontal line and an interval on another horizontal line. The time complexity of the recognition problem for simple-triangle graphs was a longstanding o
Externí odkaz:
http://arxiv.org/abs/1710.06559
Autor:
Takaoka, Asahi
Consider two horizontal lines in the plane. A pair of a point on the top line and an interval on the bottom line defines a triangle between two lines. The intersection graph of such triangles is called a simple-triangle graph. This paper shows a vert
Externí odkaz:
http://arxiv.org/abs/1611.09003
Autor:
Takaoka, Asahi
Publikováno v:
WALCOM: Algorithms and Computation. Volume 10167 of Lecture Notes in Computer Science (2017) 177-189
A simple-triangle graph (also known as a PI graph) is the intersection graph of a family of triangles defined by a point on a horizontal line and an interval on another horizontal line. The recognition problem for simple-triangle graphs was a longsta
Externí odkaz:
http://arxiv.org/abs/1605.07322