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

DOI10.1016/J.DISC.2006.09.030MaRDI QIDQ879397zbMATHOpenAlexFDO

Authors Gerard Jennhwa Chang, Changhong Lu, Sanming Zhou

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

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

Recommendations

• No-hole 2-distant colorings
• scientific article; zbMATH DE number 844150
• The perfect 2-colorings of infinite circulant graphs with a continuous set of odd distances
• scientific article; zbMATH DE number 2188369
• No-hole \(k\)-tuple \((r+1)\)-distant colorings

Cites work

• scientific article; zbMATH DE number 3853101 (Why is no real title available?)
• scientific article; zbMATH DE number 3596878 (Why is no real title available?)
• scientific article; zbMATH DE number 841613 (Why is no real title available?)
• scientific article; zbMATH DE number 844150 (Why is no real title available?)
• scientific article; zbMATH DE number 1439401 (Why is no real title available?)
• scientific article; zbMATH DE number 227553 (Why is no real title available?)
• scientific article; zbMATH DE number 3204712 (Why is no real title available?)
• scientific article; zbMATH DE number 2188369 (Why is no real title available?)
• 25 pretty graph colouring problems
• A channel assignment problem for optical networks modelled by Cayley graphs
• A local analysis of imprimitive symmetric graphs
• An Asymptotic Approach to the Channel Assignment Problem
• Distance graphs and \(T\)-coloring
• Distance-two labellings of Hamming graphs
• Every connected regular graph of even degree is a Schreier coset graph
• Finite locally-quasiprimitive graphs
• Further Results on T-Coloring and Frequency Assignment Problems
• Graph labeling and radio channel assignment
• Hamiltonian circuits in Cayley graphs
• Labelling Cayley Graphs on Abelian Groups
• List \(T\)-colorings of graphs
• Minimum span of no-hole \((r+1)\)-distant colorings
• No-hole 2-distant colorings
• No-hole \((r+1)\)-distant colorings
• No-hole \(k\)-tuple \((r+1)\)-distant colorings
• The channel assignment problem for mutually adjacent sites
• \(T\)-colorings and \(T\)-edge spans of graphs
• \(T\)-colorings of graphs
• \(T\)-colorings of graphs: recent results and open problems
• \(T\)-graphs and the channel assignment problem

Cited in

(12)

• Distance-constrained labellings of Cartesian products of graphs
• Linear and cyclic distance-three labellings of trees
• The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups
• Distance-two labellings of Hamming graphs
• Two-colorings of a dense subgroup of \({\mathbb{Q}}^ n\) that forbid many distances
• Distance labellings of Cayley graphs of semigroups
• Channel assignment on Cayley graphs
• The \(L(h,1,1)\)-labelling problem for trees
• scientific article; zbMATH DE number 2188369 (Why is no real title available?)
• Chromatic numbers of Cayley graphs of abelian groups: a matrix method
• No-hole 2-distant colorings
• Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey

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

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