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

DOI10.1016/J.DISC.2006.09.030zbMATH Open1117.05039OpenAlexW2071315514MaRDI QIDQ879397FDOQ879397

Sanming Zhou, Changhong 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

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

Cites Work

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

Cited In (12)

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

   Recommendations

• No-hole 2-distant colorings 👍 👎
• Title not available (Why is that?) 👍 👎
• The perfect 2-colorings of infinite circulant graphs with a continuous set of odd distances 👍 👎
• Title not available (Why is that?) 👍 👎
• No-hole \(k\)-tuple \((r+1)\)-distant colorings 👍 👎

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)