Relating path coverings to vertex labellings with a condition at distance two
This paper belongs to the class of papers dealing with remarkable and interesting applications of graph theory. Coming from \(\lambda\)-labelings and minimum path coverings of graphs \(G\) the three authors investigate the relationship between the so-called \(\lambda\)-number and the path covering number, and succeed in proving some interesting results.
scientific article; zbMATH DE number 716450