Computing shortest 12-representants of labeled graphs
From MaRDI portal
Publication:6644892
Publication date: 28 November 2024
Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Representing graphs via pattern avoiding words
- Words and graphs
- Semi-transitive orientations and word-representable graphs
- Word problem of the Perkins semigroup via directed acyclic graphs.
- A vertex ordering characterization of simple-triangle graphs
- On the 12-representability of induced subgraphs of a grid graph
- A recognition algorithm for simple-triangle graphs
- A comprehensive introduction to the theory of word-representable graphs
- Existence of u -Representation of Graphs
- On representable graphs
- Transitiv orientierbare Graphen
- Transitive Orientation of Graphs and Identification of Permutation Graphs
This page was built for publication: Computing shortest 12-representants of labeled graphs
