Regular codes in regular graphs are difficult
- 15 October 1994
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 133 (1-3) , 191-205
- https://doi.org/10.1016/0012-365x(94)90026-4
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On existence theoremsDiscrete Mathematics, 1993
- Perfect Codes and Regular Partitions in Graphs and GroupsEuropean Journal of Combinatorics, 1987
- Characterizations of strongly chordal graphsDiscrete Mathematics, 1983
- Determining the thickness of graphs is NP-hardMathematical Proceedings of the Cambridge Philosophical Society, 1983
- Relations between packing and covering numbers of a treePacific Journal of Mathematics, 1975
- Perfect codes in graphsJournal of Combinatorial Theory, Series B, 1973