Characterization of double-arborescences and their minimum length word-representants
From MaRDI portal
Cites work
- A Combinatorial Decomposition Theory
- A Note on "The Comparability Graph of a Tree"
- A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements
- Alternation graphs
- Complement reducible graphs
- Decomposition of Directed Graphs
- Distance labeling scheme and split decomposition
- Distance-hereditary comparability graphs
- Distance-hereditary graphs
- Enumeration and extensions of word-representants
- Enumeration of P₄-free chordal graphs
- Enumerations, forbidden subgraph characterizations, and the split-decomposition
- scientific article; zbMATH DE number 53952 (Why is no real title available?)
- Introduction to algorithms.
- Minimum length word-representants of word-representable graphs
- On a class of posets and the corresponding comparability graphs
- On representable graphs
- On the extension of bipartite to parity graphs
- Pattern matching for permutations
- Permutation Graphs and Transitive Graphs
- Quasi-threshold graphs
- Reducing prime graphs and recognizing circle graphs
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
- The Comparability Graph of a Tree
- Transforming trees by successive local complementations
- Treelike comparability graphs
- Trivially perfect graphs
- Word-representability of graphs with respect to split recomposition
This page was built for publication: Characterization of double-arborescences and their minimum length word-representants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6883344)
