scientific article
From MaRDI portal
Publication:3424780
zbMath1120.05029MaRDI QIDQ3424780
Publication date: 5 March 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (11)
On the facial Thue choice number of plane graphs via entropy compression method ⋮ Nonrepetitive colorings of trees ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ A General Framework for Hypergraph Coloring ⋮ Nonrepetitive colorings of graphs -- a survey ⋮ Pathwidth and nonrepetitive list coloring ⋮ Anagram-free graph colouring ⋮ Nonrepetitive colouring via entropy compression ⋮ Anagram-Free Colorings of Graph Subdivisions ⋮ The complexity of nonrepetitive coloring ⋮ Nonrepetitive colorings of graphs
This page was built for publication: