Relating path coverings to vertex labellings with a condition at distance two (Q1343254): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Q686169 / rank | |||
Property / reviewed by | |||
Property / reviewed by: Rainer Bodendiek / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4052166 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some Theorems on Abstract Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Covering the vertices of a graph by vertex-disjoint paths / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Arc coverings of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4873773 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(T\)-colorings of graphs: recent results and open problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: No-hole \((r+1)\)-distant colorings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hamiltonian circuits and path coverings of vertices in graphs / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:39, 23 May 2024
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
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