No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups

DOI10.1016/j.disc.2006.09.030zbMath1117.05039OpenAlexW2071315514MaRDI QIDQ879397

Sanming Zhou, Chang-hong Lu, Gerard Jennhwa Chang

Publication date: 11 May 2007

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

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

zbMATH Keywords

channel assignment\(t\)-coloring

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15)

Related Items (9)

Chromatic numbers of Cayley graphs of abelian groups: a matrix method ⋮ Distance labellings of Cayley graphs of semigroups ⋮ The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups ⋮ Distance-constrained labellings of Cartesian products of graphs ⋮ Channel assignment on Cayley graphs ⋮ The \(L(h,1,1)\)-labelling problem for trees ⋮ Linear and cyclic distance-three labellings of trees ⋮ Distance-two labellings of Hamming graphs ⋮ Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• No-hole \((r+1)\)-distant colorings
• Distance-two labellings of Hamming graphs
• Hamiltonian circuits in Cayley graphs
• \(T\)-colorings of graphs: recent results and open problems
• \(T\)-colorings of graphs
• Every connected regular graph of even degree is a Schreier coset graph
• Distance graphs and \(T\)-coloring
• List \(T\)-colorings of graphs
• No-hole 2-distant colorings
• The channel assignment problem for mutually adjacent sites
• Finite locally-quasiprimitive graphs
• \(T\)-graphs and the channel assignment problem
• \(T\)-colorings and \(T\)-edge spans of graphs
• A channel assignment problem for optical networks modelled by Cayley graphs
• No-hole \(k\)-tuple \((r+1)\)-distant colorings
• A local analysis of imprimitive symmetric graphs
• Minimum Span of No-Hole (r+1)-Distant Colorings
• An Asymptotic Approach to the Channel Assignment Problem
• Graph labeling and radio channel assignment
• Further Results on T-Coloring and Frequency Assignment Problems
• Labelling Cayley Graphs on Abelian Groups
• 25 pretty graph colouring problems

This page was built for publication: No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups