Pair \(L(2, 1)\)-labelings of infinite graphs

DOI10.7151/DMGT.2077zbMath1401.05264OpenAlexW2801618118WikidataQ129952549 ScholiaQ129952549MaRDI QIDQ1630941

Roger K.-C. Yeh

Publication date: 5 December 2018

Published in: Unnamed Author (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2077

zbMATH Keywords

\(L(2, 1)\)-labeling

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Infinite graphs (05C63)

Related Items (1)

n-fold L(2, 1)-labelings of Cartesian product of paths and cycles

Cites Work

• No-hole \(L(2,1)\)-colorings
• A survey on labeling graphs with a condition at distance two
• Pair Labellings with Given Distance
• Real Number Channel Assignments for Lattices
• Real Number Labelings for Paths and Cycles
• Labelling Graphs with a Condition at Distance 2

This page was built for publication: Pair \(L(2, 1)\)-labelings of infinite graphs