Facial anagram-free edge-coloring of plane graphs
From MaRDI portal
Publication:2399301
Recommendations
Cites work
- scientific article; zbMATH DE number 3162927 (Why is no real title available?)
- scientific article; zbMATH DE number 3547322 (Why is no real title available?)
- scientific article; zbMATH DE number 3296252 (Why is no real title available?)
- scientific article; zbMATH DE number 3375509 (Why is no real title available?)
- Abelian squares are avoidable on 4 letters
- Anagram-free colorings of graphs
- Facial non-repetitive edge colouring of semiregular polyhedra
- Facial non-repetitive edge-coloring of plane graphs
- Facial nonrepetitive vertex coloring of plane graphs
- Facially-constrained colorings of plane graphs: a survey
- Graph theory
- Is There a Sequence on Four Symbols in Which No Two Adjacent Segments are Permutations of One Another?
- New bounds for facial nonrepetitive colouring
- Nonrepetitive colorings of graphs
- Nonrepetitive colorings of graphs -- a survey
- Nonrepetitive colorings of graphs of bounded tree-width
- Nonrepetitive colorings of trees
- Nonrepetitive colouring via entropy compression
- Nonrepetitive vertex colorings of graphs
- On square-free vertex colorings of graphs
- Pattern avoidance on graphs
- Strongly non-repetitive sequences and progression-free sets
- There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
- Trees in Polyhedral Graphs
Cited in
(3)
This page was built for publication: Facial anagram-free edge-coloring of plane graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399301)