Relating path coverings to vertex labellings with a condition at distance two
- 25 December 1994
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 135 (1-3) , 103-111
- https://doi.org/10.1016/0012-365x(93)e0098-o
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- No-hole (r+1)-distant coloringsDiscrete Mathematics, 1993
- T-colorings of graphs: recent results and open problemsDiscrete Mathematics, 1991
- Frequency assignment: Theory and applicationsProceedings of the IEEE, 1980
- Covering the vertices of a graph by vertex-disjoint pathsPacific Journal of Mathematics, 1975
- Hamiltonian circuits and path coverings of vertices in graphsColloquium Mathematicum, 1974
- Arc coverings of graphsAnnali di Matematica Pura ed Applicata (1923 -), 1961
- Some Theorems on Abstract GraphsProceedings of the London Mathematical Society, 1952