Nonrepetitive colorings of graphs of bounded tree-width
From MaRDI portal
Publication:941387
DOI10.1016/j.disc.2007.08.043zbMath1154.05033WikidataQ30048336 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
05C15: Coloring of graphs and hypergraphs
Related Items
New approach to nonrepetitive sequences, Minor-Closed Graph Classes with Bounded Layered Pathwidth, Improved Bounds for Centered Colorings, Shallow Minors, Graph Products, and Beyond-Planar Graphs, The product structure of squaregraphs, Extensions and reductions of squarefree words, Thue choosability of trees, Nonrepetitive colorings of line arrangements, Pathwidth and nonrepetitive list coloring, Nonrepetitive colouring via entropy compression, Rainbow generalizations of Ramsey theory: A survey, Nonrepetitive vertex colorings of graphs, Characterisations and examples of graph classes with bounded expansion, Fractional Thue chromatic number of graphs, Nonrepetitive colorings of graphs -- a survey, Thue type problems for graphs, points, and numbers, Improved bounds for weak coloring numbers, A note about online nonrepetitive coloring \(k\)-trees, Colouring exact distance graphs of chordal graphs, 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, New bounds for facial nonrepetitive colouring, Breaking the rhythm on graphs, Graph theory. Abstracts from the workshop held January 2--8, 2022, Facial Nonrepetitive Vertex Coloring of Plane Graphs, Parameters Tied to Treewidth
Cites Work
