On square-free vertex colorings of graphs
From MaRDI portal
Publication:3539570
DOI10.1556/SScMath.2007.1029zbMath1164.05021MaRDI QIDQ3539570
Publication date: 19 November 2008
Published in: Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1556/sscmath.2007.1029
05C15: Coloring of graphs and hypergraphs
Related Items
New approach to nonrepetitive sequences, Nonrepetitive colorings of graphs, Nonrepetitive colorings of line arrangements, Nonrepetitive vertex colorings of graphs, Characterisations and examples of graph classes with bounded expansion, Nonrepetitive colorings of trees, Nonrepetitive colorings of graphs -- a survey, Total Thue colourings of 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, Facial Nonrepetitive Vertex Coloring of Plane Graphs, Facial non-repetitive edge-coloring of plane graphs, Nonrepetitive list colourings of paths