On the representation number of a crown graph
From MaRDI portal
Publication:1752592
DOI10.1016/j.dam.2018.03.013zbMath1387.05169arXiv1609.00674OpenAlexW2963886547MaRDI QIDQ1752592
Sergey Kitaev, Marc Glen, Artem V. Pyatkin
Publication date: 24 May 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.00674
Related Items
Minimum length word-representants of word-representable graphs, Polygon-circle and word-representable graphs, Symbolic powers of certain cover ideals of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Words and graphs
- Semi-transitive orientations and word-representable graphs
- Word problem of the Perkins semigroup via directed acyclic graphs.
- Enumerating split-pair arrangements
- Coloring circle graphs
- 3-coloring in time
- THE PERKINS SEMIGROUP HAS CO-NP-COMPLETE TERM-EQUIVALENCE PROBLEM
- On representable graphs
- On graphs with representation number 3