Pages that link to "Item:Q908303"
From MaRDI portal
The following pages link to Semi-transitive orientations and word-representable graphs (Q908303):
Displaying 20 items.
- Word-representability of triangulations of grid-covered cylinder graphs (Q313795) (← links)
- Word-representability of face subdivisions of triangular grid graphs (Q343715) (← links)
- On graphs representable by pattern-avoiding words (Q1717191) (← links)
- On the representation number of a crown graph (Q1752592) (← links)
- Word-representability of split graphs generated by morphisms (Q2127634) (← links)
- Representing split graphs by words (Q2158202) (← links)
- On semi-transitive orientability of Kneser graphs and their complements (Q2185911) (← links)
- Word-representability of Toeplitz graphs (Q2334044) (← links)
- On operations preserving semi-transitive orientability of graphs (Q2424730) (← links)
- Solving computational problems in the theory of word-representable graphs (Q3120420) (← links)
- Word-Representable Graphs: a Survey (Q4558287) (← links)
- The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group (Q6097068) (← links)
- On semi-transitive orientability of split graphs (Q6121421) (← links)
- An embedding technique in the study of word-representability of graphs (Q6153476) (← links)
- Forbidden pattern characterizations of 12-representable graphs defined by pattern-avoiding words (Q6611075) (← links)
- New tools to study 1-11-representation of graphs (Q6616436) (← links)
- On semi-transitivity of (extended) Mycielski graphs (Q6633525) (← links)
- Word-representable graphs from a word's perspective (Q6634508) (← links)
- Word-representable graphs: orientations, posets, and bounds (Q6635157) (← links)
- Computing shortest 12-representants of labeled graphs (Q6644892) (← links)
