Relating path coverings to vertex labellings with a condition at distance two
type: Item
instance of: scholarly article
title: Relating path coverings to vertex labellings with a condition at distance two
zbMATH Open document ID: 0811.05058
DOI: 10.1016/0012-365X(93)E0098-O
author: John P. Georges
author: David Mauro
author: Marshall A. Whittlesey
published in: Discrete Mathematics
publication date: 1995-02-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 716450
zbMATH Keywords: vertex labellings
zbMATH Keywords: path coverings
zbMATH Keywords: \(\lambda\)-number
reviewed by: Rainer Bodendiek
MaRDI profile type: Publication
cites work: Q4052166
cites work: Q5422499
cites work: Some Theorems on Abstract Graphs
cites work: Labelling Graphs with a Condition at Distance 2
cites work: Covering the vertices of a graph by vertex-disjoint paths
cites work: Arc coverings of graphs
cites work: Q4873773
cites work: \(T\)-colorings of graphs: recent results and open problems
cites work: No-hole \((r+1)\)-distant colorings
cites work: Hamiltonian circuits and path coverings of vertices in graphs
description: scientific article; zbMATH DE number 716450