Distance-constrained labellings of Cartesian products of graphs
Open Access
- 1 December 2021
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 304, 375-383
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Agencia Estatal de Investigación (MTM2017-82166-P)
- University of Melbourne (MTM2017-82166-P)
This publication has 25 references indexed in Scilit:
- Distance three labelings of treesDiscrete Applied Mathematics, 2012
- Griggs and Yeh's Conjecture and $L(p,1)$-labelingsSIAM Journal on Discrete Mathematics, 2012
- The L(h, k)-Labelling Problem: An Updated Survey and Annotated BibliographyThe Computer Journal, 2011
- Distance-two labellings of Hamming graphsDiscrete Applied Mathematics, 2009
- L(h, 1, 1)-labeling of outerplanar graphsMathematical Methods of Operations Research, 2008
- No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groupsDiscrete Mathematics, 2007
- Labeling Products of Complete Graphs with a Condition at Distance TwoSIAM Journal on Discrete Mathematics, 2001
- Labelling Graphs with a Condition at Distance 2SIAM Journal on Discrete Mathematics, 1992
- Homogeneous distribution of frequencies in a regular hexagonal cell systemIEEE Transactions on Vehicular Technology, 1982
- Frequency assignment: Theory and applicationsProceedings of the IEEE, 1980