T-colorings of graphs: recent results and open problems
- 1 November 1991
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 93 (2-3) , 229-245
- https://doi.org/10.1016/0012-365x(91)90258-4
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Further Results on T-Coloring and Frequency Assignment ProblemsSIAM Journal on Discrete Mathematics, 1994
- No-hole (r+1)-distant coloringsDiscrete Mathematics, 1993
- No-hole 2-distant coloringsMathematical and Computer Modelling, 1993
- Pair Labellings with Given DistanceSIAM Journal on Discrete Mathematics, 1989
- Space graphs and sphericityDiscrete Applied Mathematics, 1984
- The combinatorial distance geometry method for the calculation of molecular conformation II. Sample problems and computational statisticsJournal of Theoretical Biology, 1983
- The combinatorial distance geometry method for the calculation of molecular conformation. I. A new approach to an old problemJournal of Theoretical Biology, 1983
- Optimal assignment of broadcasting frequenciesEuropean Journal of Operational Research, 1982
- ON THE MOBILE RADIO FREQUENCY ASSIGNMENT PROBLEM AND THE TRAFFIC LIGHT PHASING PROBLEMAnnals of the New York Academy of Sciences, 1979
- n-Tuple colorings and associated graphsJournal of Combinatorial Theory, Series B, 1976