Extension of universal cycles for globally identifying colorings of cycles

DOI10.1016/J.DISC.2017.02.002zbMATH Open1361.05042OpenAlexW2602576898MaRDI QIDQ526222FDOQ526222

Pierre Coupechoux

Publication date: 10 May 2017

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

Full work available at URL: https://hal.laas.fr/hal-01704385/file/cycles.pdf

Recommendations

• On cages admitting identifying codes
• On two variations of identifying codes
• On a new class of codes for identifying vertices in graphs
• New bounds on binary identifying codes
• Optimal identifying codes in cycles and paths

zbMATH Keywords

cyclesidentifying codesuniversal cyclesidentifying coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Cites Work

• On a new class of codes for identifying vertices in graphs
• On the number of optimal identifying codes in a twin-free graph
• Identifying and locating-dominating codes on chains and cycles
• Universal cycles of \(k\)-subsets and \(k\)-permutations
• Locally identifying colourings for graphs with given maximum degree
• On codes identifying sets of vertices in Hamming spaces
• Codes identifying sets of vertices in random networks
• Identifying codes of cycles
• On the identification of sets of points in the square lattice
• Optimal identifying codes in cycles and paths

This page was built for publication: Extension of universal cycles for globally identifying colorings of cycles

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