Circular Distance Two Labeling and the $\lambda$-Number for Outerplanar Graphs

DOI10.1137/S0895480102414296zbMath1090.05027OpenAlexW2027960963MaRDI QIDQ5470758

Daphne Der-Fen Liu, Xuding Zhu

Publication date: 1 June 2006

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

Full work available at URL: https://doi.org/10.1137/s0895480102414296

Mathematics Subject Classification ID

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

Related Items (10)

Backbone coloring for graphs with large girths ⋮ List backbone colouring of graphs ⋮ The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups ⋮ Circular \(L(j,k)\)-labeling number of direct product of path and cycle ⋮ Exact algorithm for graph homomorphism and locally injective graph homomorphism ⋮ Chromatic number of square of maximal outerplanar graphs ⋮ Radio number for trees ⋮ \(L(j,k)\)-labeling number of Cartesian product of path and cycle ⋮ On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path ⋮ Some results on distance two labelling of outerplanar graphs

This page was built for publication: Circular Distance Two Labeling and the $\lambda$-Number for Outerplanar Graphs