Pair Labellings with Given Distance
- 1 November 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 2 (4) , 491-499
- https://doi.org/10.1137/0402044
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Kneser's conjecture, chromatic number, and homotopyPublished by Elsevier ,2004
- On the complexity of H-coloringJournal of Combinatorial Theory, Series B, 1990
- Homomorphisms of graphs into odd cyclesJournal of Graph Theory, 1988
- Generalized ColoringsPublished by Elsevier ,1987
- Extremal problems concerning Kneser graphsJournal of Combinatorial Theory, Series B, 1986
- The chromatic number of Kneser hypergraphsTransactions of the American Mathematical Society, 1986
- On the complexity of the general coloring problemInformation and Control, 1981
- A short proof of Kneser's conjectureJournal of Combinatorial Theory, Series A, 1978