Word-representable graphs and locality of words
From MaRDI portal
Cites work
- Approximating clique-width and branch-width
- Blocksequences of \(k\)-local words
- Clique-width and the speed of hereditary properties
- Clique-width is NP-complete
- Deciding the Bell number for hereditary graph properties
- Finding patterns common to a set of strings
- Graph and string parameters: connections between pathwidth, cutwidth and the locality number
- Graphs Capturing Alternations in Words
- Hereditary and monotone properties of combinatorial structure
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 2044928 (Why is no real title available?)
- scientific article; zbMATH DE number 1472167 (Why is no real title available?)
- scientific article; zbMATH DE number 7278096 (Why is no real title available?)
- Human-verifiable proofs in the theory of word-representable graphs
- Linear time solvable optimization problems on graphs of bounded clique-width
- New results on word-representable graphs
- On representable graphs
- On the clique-width of some perfect graph classes
- On the entropy values of hereditary classes of graphs
- On the Relationship Between Clique-Width and Treewidth
- On the representation number of a crown graph
- On the size of hereditary classes of graphs
- Semi-transitive orientations and word-representable graphs
- Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity
- Threshold graphs and related topics
- Word-representable graphs from a word's perspective
- Words and graphs
This page was built for publication: Word-representable graphs and locality of words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6884667)
