On critical trees labeled with a condition at distance two
From MaRDI portal
(Redirected from Publication:556846)
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
Cites work
- scientific article; zbMATH DE number 1185300 (Why is no real title available?)
- scientific article; zbMATH DE number 1792593 (Why is no real title available?)
- scientific article; zbMATH DE number 841588 (Why is no real title available?)
- scientific article; zbMATH DE number 881282 (Why is no real title available?)
- Hamiltonicity and circular distance two labellings
- Labeling Chordal Graphs: Distance Two Condition
- Labeling products of complete graphs with a condition at distance two
- Labelling Graphs with a Condition at Distance 2
- No-hole \(L(2,1)\)-colorings
- On \(L(d,1)\)-labelings of graphs
- On generalized Petersen graphs labeled with a condition at distance two
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- Relating path coverings to vertex labellings with a condition at distance two
- The $L(2,1)$-Labeling Problem on Graphs
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)
