Relating path coverings to vertex labellings with a condition at distance two (Q1343254)

From MaRDI portal
Revision as of 11:39, 23 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Relating path coverings to vertex labellings with a condition at distance two
scientific article

    Statements

    Relating path coverings to vertex labellings with a condition at distance two (English)
    0 references
    0 references
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    vertex labellings
    0 references
    path coverings
    0 references
    \(\lambda\)-number
    0 references