On the facial Thue choice index of plane graphs
From MaRDI portal
Publication:418875
DOI10.1016/j.disc.2012.01.023zbMath1242.05102MaRDI QIDQ418875
Jens Schreyer, Erika Fecková Škrabuľáková
Publication date: 30 May 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.01.023
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
On the facial Thue choice number of plane graphs via entropy compression method, Total Thue colourings of graphs, On a generalization of Thue sequences, Facially-constrained colorings of plane graphs: a survey, New bounds for facial nonrepetitive colouring, On the Facial Thue Choice Index via Entropy Compression
Cites Work
- Lopsided Lovász Local lemma and Latin transversals
- Thue type problems for graphs, points, and numbers
- Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs
- There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
- Facial non-repetitive edge-coloring of plane graphs
- Nonrepetitive list colourings of paths
- Nonrepetitive colorings of graphs
- Unnamed Item
- Unnamed Item