On critical trees labeled with a condition at distance two

DOI10.1016/J.DISC.2005.02.011zbMATH Open1066.05134OpenAlexW2027635431MaRDI QIDQ556846FDOQ556846

Authors: 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

Recommendations

• Labeling trees with a condition at distance two
• Labeling trees with a condition at distance two
• Labeling trees with a condition at distance two.
• scientific article; zbMATH DE number 841588
• scientific article; zbMATH DE number 7651097
• On vertex \(b\)-critical trees
• Distance Constrained Labelings of Trees
• A characterization of \(b_e\)-critical trees
• A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable
• A note on \(L (2, 1)\)-labelling of trees

zbMATH Keywords

vertex labelingdistance two labeling

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

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

This page was built for publication: On critical trees labeled with a condition at distance two

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