On the 12-Representability of Induced Subgraphs of a Grid Graph
The notion of a 12-representable graph was introduced by Jones, Kitaev, Pyatkin and Remmel in [Representing graphs via pattern avoiding words, Electron. J. Combin. 22 (2015) #P2.53]. This notion generalizes the notions of the much studied permutation graphs and co-interval graphs. It is known that a...
Main Authors: | Chen Joanna N., Kitaev Sergey |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2022-05-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2263 |
Similar Items
-
The spectral Turán problem about graphs of given size with forbidden subgraphs
by: Amir Rehman, et al.
Published: (2024-11-01) -
Forbidden subgraphs of TI-power graphs of finite groups
by: Li Huani, et al.
Published: (2025-02-01) -
Toughness, Forbidden Subgraphs, and Hamilton-Connected Graphs
by: Zheng Wei, et al.
Published: (2022-02-01) -
A Finite Characterization and Recognition of Intersection Graphs of Hypergraphs with Rank at Most 3 and Multiplicity at Most 2 in the Class of Threshold Graphs
by: Metelsky Yury, et al.
Published: (2017-02-01) -
Requiring that Minimal Separators Induce Complete Multipartite Subgraphs
by: McKee Terry A.
Published: (2018-02-01)