deBruijn-like sequences and the irregular chromatic number of paths and cycles

DOI10.1016/j.disc.2009.05.015zbMath1203.05005OpenAlexW1983658789MaRDI QIDQ1045102

J. Blot

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.05.015

zbMATH Keywords

deBruijn sequencedistinguishingirregular chromatic number

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Special sequences and polynomials (11B83)

Cites Work

• The distinguishing chromatic number
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• Symmetry breaking in graphs
• A fast algorithm for the construction of universal footprinting templates in DNA
• Distinguishing geometric graphs
• Every planar map is four colorable
• Vertex-distinguishing proper edge-colorings
• Distinguishing Cartesian powers of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: deBruijn-like sequences and the irregular chromatic number of paths and cycles