On critical trees labeled with a condition at distance two

DOI10.1016/j.disc.2005.02.011zbMath1066.05134OpenAlexW2027635431MaRDI QIDQ556846

Denise Sakai Troxell

Publication date: 23 June 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.02.011

zbMATH Keywords

vertex labelingdistance two labeling

Mathematics Subject Classification ID

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

Related Items

\(L(2,1)\)-labelings of Cartesian products of two cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relating path coverings to vertex labellings with a condition at distance two
• No-hole \(L(2,1)\)-colorings
• On \(L(d,1)\)-labelings of graphs
• On generalized Petersen graphs labeled with a condition at distance two
• Labeling Products of Complete Graphs with a Condition at Distance Two
• Labelling Graphs with a Condition at Distance 2
• Labeling Chordal Graphs: Distance Two Condition
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• The $L(2,1)$-Labeling Problem on Graphs
• Hamiltonicity and circular distance two labellings