Non-repetitive 3-coloring of subdivided graphs

zbMATH Open1165.05325MaRDI QIDQ1028809FDOQ1028809

Authors: Andrzej Pezarski, Michał Zmarz 

Publication date: 8 July 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/130283

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge
• Nonrepetitive colorings of trees
• Notes on nonrepetitive graph colouring
• Nonrepetitive colorings of graphs
• Nonrepetitive graph colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (12)

• 3-Regular subgraphs and (3,1)-colorings of 4-regular pseudographs
• Avoiding squares over words with lists of size three amongst four symbols
• Characterisations and examples of graph classes with bounded expansion
• New bounds for facial nonrepetitive colouring
• Anagram-Free Colorings of Graph Subdivisions
• Nonrepetitive colouring via entropy compression
• 3-colourability and forbidden subgraphs
• Repetition thresholds for subdivided graphs and trees
• Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge
• Nonrepetitive colorings of trees
• Facial non-repetitive edge-coloring of plane graphs
• Nonrepetitive list colourings of paths

This page was built for publication: Non-repetitive 3-coloring of subdivided graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1028809)