scientific article; zbMATH DE number 841588

MaRDI QIDQ4863434zbMATH OpenFDO

Authors John P. Georges, David Mauro

Publication date 6 February 1996

zbMATH Keywords

\(k\)-critical graphscomplete multipartite graphscondition at distance twolabellingpath covering number

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• scientific article; zbMATH DE number 881282
• scientific article; zbMATH DE number 1854040
• Labelling Graphs with a Condition at Distance 2
• A survey on labeling graphs with a condition at distance two
• On Regular Graphs Optimally Labeled with a Condition at Distance Two
• scientific article; zbMATH DE number 1409224
• scientific article; zbMATH DE number 1778431
• On diameter 2-critical graphs
• On L(2,1)-labellings of distance graphs
• On \(k\)-critical \(2 k\)- connected graphs

Cited in

(8)

• The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications
• On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
• On L(2,1)-labelings of Cartesian products of paths and cycles
• Distance-two labelings of graphs
• \(L(2,1)\)-labelings of Cartesian products of two cycles
• A survey on labeling graphs with a condition at distance two
• L(2,1)-labelings on the modular product of two graphs
• On critical trees labeled with a condition at distance two

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4863434)