scientific article; zbMATH DE number 6730060
From MaRDI portal
Publication:5267684
Recommendations
- Subword complexity and Sturmian colorings of regular trees
- Colorings of trees with linear, intermediate and exponential subball complexity
- Quasi-Sturmian colorings on regular trees
- Tree-depth, subgraph coloring and homomorphism bounds
- scientific article; zbMATH DE number 1929966
- On the Complexity of Some Colorful Problems Parameterized by Treewidth
- On the complexity of some colorful problems parameterized by treewidth
- scientific article; zbMATH DE number 4132187
- On the complexity of \(\mathbb{H}\)-coloring for special oriented trees
- On the chromaticity of certain subgraphs of a q-tree
Cited in
(7)- Noncrossing monochromatic subtrees and staircases in 0-1 matrices
- Colorings of trees with linear, intermediate and exponential subball complexity
- A First Investigation of Sturmian Trees
- Quasi-Sturmian colorings on regular trees
- Continued fraction algorithm for Sturmian colorings of trees
- Subword complexity and Sturmian colorings of regular trees
- Sturmian trees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267684)
