Graph classes equivalent to 12-representable graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 437537 (Why is no real title available?)
- scientific article; zbMATH DE number 4063148 (Why is no real title available?)
- scientific article; zbMATH DE number 2117210 (Why is no real title available?)
- A comprehensive introduction to the theory of word-representable graphs
- A recognition algorithm for simple-triangle graphs
- A vertex ordering characterization of simple-triangle graphs
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- Efficient graph representations
- Existence of \(u\)-representation of graphs
- Graph Classes: A Survey
- Graph classes and forbidden patterns on three vertices
- List homomorphisms and circular arc graphs
- Non-edge orientation and vertex ordering characterizations of some classes of bigraphs
- On orthogonal ray graphs
- On the 12-representability of induced subgraphs of a grid graph
- Permutation bigraphs and interval containments
- Recognizing simple-triangle graphs by restricted 2-chain subgraph cover
- Representation characterizations of chordal bipartite graphs
- Representing graphs via pattern avoiding words
- The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial
- Transitiv orientierbare Graphen
- Words and graphs
This page was built for publication: Graph classes equivalent to 12-representable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6985896)
