Nonrepetitive colorings of graphs of bounded tree-width
From MaRDI portal
Publication:941387
DOI10.1016/j.disc.2007.08.043zbMath1154.05033OpenAlexW2105469400WikidataQ30048336 ScholiaQ30048336MaRDI QIDQ941387
Michael J. Pelsmajer, André Kündgen
Publication date: 4 September 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.043
Related Items (27)
Improved bounds for weak coloring numbers ⋮ Facial anagram-free edge-coloring of plane graphs ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Layered separators in minor-closed graph classes with applications ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ New bounds for facial nonrepetitive colouring ⋮ Thue choosability of trees ⋮ Shallow Minors, Graph Products, and Beyond-Planar Graphs ⋮ The product structure of squaregraphs ⋮ A note about online nonrepetitive coloring \(k\)-trees ⋮ Extensions and reductions of squarefree words ⋮ Fractional Thue chromatic number of graphs ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Parameters Tied to Treewidth ⋮ Minor-Closed Graph Classes with Bounded Layered Pathwidth ⋮ Nonrepetitive colorings of graphs -- a survey ⋮ Nonrepetitive vertex colorings of graphs ⋮ Characterisations and examples of graph classes with bounded expansion ⋮ Thue type problems for graphs, points, and numbers ⋮ Nonrepetitive colorings of line arrangements ⋮ Pathwidth and nonrepetitive list coloring ⋮ New approach to nonrepetitive sequences ⋮ Improved Bounds for Centered Colorings ⋮ Breaking the rhythm on graphs ⋮ Nonrepetitive colouring via entropy compression ⋮ Colouring exact distance graphs of chordal graphs ⋮ Facial Nonrepetitive Vertex Coloring of Plane Graphs
Cites Work
This page was built for publication: Nonrepetitive colorings of graphs of bounded tree-width
