Some results on distance two labelling of outerplanar graphs
From MaRDI portal
Publication:1036889
DOI10.1007/s10255-006-6065-7zbMath1197.05135OpenAlexW1998771481MaRDI QIDQ1036889
Publication date: 13 November 2009
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-006-6065-7
Cites Work
- Unnamed Item
- Unnamed Item
- Coloring the square of a \(K_{4}\)-minor free graph
- On \(L(d,1)\)-labelings of graphs
- Choosability, edge choosability and total choosability of outerplane graphs
- \(L(h,1)\)-labeling subclasses of planar graphs
- A bound on the chromatic number of the square of a planar graph
- The \(L(2,1)\)-labelling of trees
- 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
- A Theorem about the Channel Assignment Problem
- Labeling Planar Graphs with Conditions on Girth and Distance Two
- Coloring the square of a planar graph
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- The $L(2,1)$-Labeling Problem on Graphs
- Circular Distance Two Labeling and the $\lambda$-Number for Outerplanar Graphs
