Facial anagram-free edge-coloring of plane graphs
From MaRDI portal
Publication:2399301
DOI10.1016/j.dam.2017.06.018zbMath1368.05048OpenAlexW2738747769MaRDI QIDQ2399301
Július Czap, Roman Soták, Stanlislav Jendroľ
Publication date: 22 August 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.06.018
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonrepetitive colouring via entropy compression
- Nonrepetitive vertex colorings of graphs
- Nonrepetitive colorings of trees
- Pattern avoidance on graphs
- Nonrepetitive colorings of graphs -- a survey
- Nonrepetitive colorings of graphs of bounded tree-width
- Strongly non-repetitive sequences and progression-free sets
- Anagram-free colorings of graphs
- There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
- Facially-constrained colorings of plane graphs: a survey
- New bounds for facial nonrepetitive colouring
- Facial Nonrepetitive Vertex Coloring of Plane Graphs
- Facial non-repetitive edge-coloring of plane graphs
- On square-free vertex colorings of graphs
- Nonrepetitive colorings of graphs
- Abelian squares are avoidable on 4 letters
- Trees in Polyhedral Graphs
- Is There a Sequence on Four Symbols in Which No Two Adjacent Segments are Permutations of One Another?
This page was built for publication: Facial anagram-free edge-coloring of plane graphs
