On Graphs Representable by Pattern-Avoiding Words
In this paper we study graphs defined by pattern-avoiding words. Word-representable graphs have been studied extensively following their introduction in 2004 and are the subject of a book published by Kitaev and Lozin in 2015. Recently there has been interest in studying graphs represented by patter...
Main Author: | Mandelshtam Yelena |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2019-05-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2128 |
Similar Items
-
Tight toughness bounds for path-factor critical avoidable graphs
by: Wenqi Wang, et al.
Published: (2024-05-01) -
Construction of Barnette graphs whose large subgraphs are non-Hamiltonian
by: Pirzada S., et al.
Published: (2019-12-01) -
Some Results on Path-Factor Critical Avoidable Graphs
by: Zhou Sizhong
Published: (2023-02-01) -
Hamiltonian Normal Cayley Graphs
by: Montellano-Ballesteros Juan José, et al.
Published: (2019-08-01) -
Properties of uniformly $3$-connected graphs
by: Frank Göring, et al.
Published: (2024-06-01)