The -labeling of -free graphs and its applications
Authors:
- Zhendong ShaoZSZhendong Shao
- Roger K. YehRYRoger K. Yeh
- Kin Keung PoonKPKin Keung Poon
- Wai Chee ShiuWSWai Chee Shiu
- 1 November 2008
- journal article
- Published by Elsevier in Applied Mathematics Letters
- Vol. 21 (11) , 1188-1193
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- The L(2,1)-labeling and operations of graphsIEEE Transactions on Circuits and Systems I: Regular Papers, 2005
- On L(2,1)-labelings of Cartesian products of paths and cyclesDiscrete Mathematics, 2004
- A Theorem about the Channel Assignment ProblemSIAM Journal on Discrete Mathematics, 2003
- On L(d,1)-labelings of graphsDiscrete Mathematics, 2000
- The $L(2,1)$-Labeling Problem on GraphsSIAM Journal on Discrete Mathematics, 1996
- On the size of graphs labeled with a condition at distance twoJournal of Graph Theory, 1996
- Labeling Chordal Graphs: Distance Two ConditionSIAM Journal on Discrete Mathematics, 1994
- Labelling Graphs with a Condition at Distance 2SIAM Journal on Discrete Mathematics, 1992
- T-colorings of graphs: recent results and open problemsDiscrete Mathematics, 1991
- Frequency assignment: Theory and applicationsProceedings of the IEEE, 1980