Relating path coverings to vertex labellings with a condition at distance two (Q1343254)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Relating path coverings to vertex labellings with a condition at distance two |
scientific article; zbMATH DE number 716450
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Relating path coverings to vertex labellings with a condition at distance two |
scientific article; zbMATH DE number 716450 |
Statements
Relating path coverings to vertex labellings with a condition at distance two (English)
0 references
1 February 1995
0 references
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.
0 references
vertex labellings
0 references
path coverings
0 references
\(\lambda\)-number
0 references
