On square-free vertex colorings of graphs
From MaRDI portal
Publication:3539570
DOI10.1556/SScMath.2007.1029zbMath1164.05021OpenAlexW2141481529MaRDI 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
Related Items
Nonrepetitive colorings of trees, 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, Nonrepetitive colorings of graphs -- a survey, Nonrepetitive vertex colorings of graphs, Characterisations and examples of graph classes with bounded expansion, Nonrepetitive colorings of line arrangements, New approach to nonrepetitive sequences, Facial non-repetitive edge-coloring of plane graphs, Nonrepetitive list colourings of paths, Nonrepetitive colorings of graphs, Facial Nonrepetitive Vertex Coloring of Plane Graphs, Total Thue colourings of graphs