The following pages link to Pattern avoidance on graphs (Q878624):
Displayed 12 items.
- Pathwidth and nonrepetitive list coloring (Q504976) (← links)
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
- Grasshopper avoidance of patterns (Q727190) (← links)
- An estimate for the probability of dependent events (Q956348) (← links)
- On avoding \(r\)-repetitions in \(\mathbb R^2\) (Q1689937) (← links)
- Facial anagram-free edge-coloring of plane graphs (Q2399301) (← links)
- Facial Nonrepetitive Vertex Coloring of Plane Graphs (Q2852615) (← links)
- Facial non-repetitive edge-coloring of plane graphs (Q3067060) (← links)
- Highly nonrepetitive sequences: Winning strategies from the local lemma (Q3068764) (← links)
- A Frameless 2-Coloring of the Plane Lattice (Q5019913) (← links)
- On some interesting ternary formulas (Q5894536) (← links)
- Nonrepetitive and pattern-free colorings of the plane (Q5964253) (← links)