Kittitat Iamthong

collaborators

3 papers

math.CO2021

Semi-transitivity of directed split graphs generated by morphisms

Kittitat Iamthong, Sergey Kitaev

A directed graph is semi-transitive if and only if it is acyclic and for any directed path $u_{1} \to u_{2} \to \dots \to u_{t}$ , $t \geq 2$ , either there is no ed…

math.CO2021

Word-representability of split graphs generated by morphisms

Kittitat Iamthong

A graph $G = (V, E)$ is word-representable if and only if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$ , $x \neq = y$ , alternate in $w$ if and only if $xy\i…

math.CO2020

Encoding labelled $p$ -Riordan graphs by words and pattern-avoiding permutations

Kittitat Iamthong, Ji-Hwan Jung, Sergey Kitaev

The notion of a $p$ -Riordan graph generalizes that of a Riordan graph, which, in turn, generalizes the notions of a Pascal graph and a Toeplitz graph. In this paper we introduce th…

Semi-transitivity of directed split graphs generated by morphisms

Word-representability of split graphs generated by morphisms

Encoding labelled p-Riordan graphs by words and pattern-avoiding permutations

Encoding labelled $p$ -Riordan graphs by words and pattern-avoiding permutations