Facial anagram-free edge-coloring of plane graphs

DOI10.1016/J.DAM.2017.06.018MaRDI QIDQ2399301zbMATH OpenOpenAlexFDO

Authors Július Czap, Roman Soták, Stanislav 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

zbMATH Keywords

plane graphedge coloringfacial walk

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Recommendations

• Anagram-free colorings of graphs
• Anagram-free colourings of graphs
• Anagram-free graph colouring
• Anagram-Free Colorings of Graph Subdivisions
• Facial non-repetitive edge-coloring of plane graphs

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)

• Anagram-free colorings of graphs
• scientific article; zbMATH DE number 1222597 (Why is no real title available?)
• Anagram-free colourings of graphs

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)