The (2,1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2
From MaRDI portal
Publication:3000498
DOI10.1007/978-3-642-19222-7_11zbMath1326.05131MaRDI QIDQ3000498
Yushi Uno, Toshimasa Ishii, Hirotaka Ono, Toru Hasunuma
Publication date: 19 May 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19222-7_11
05C10: Planar graphs; geometric and topological aspects of graph theory
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Related Items
Cites Work
- A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs
- On \((d,1)\)-total numbers of graphs
- \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree
- \((2,1)\)-total labelling of outerplanar graphs
- \((p,1)\)-total labelling of graphs
- A survey on labeling graphs with a condition at distance two
- (d,1)-total labeling of graphs with a given maximum average degree
- Labelling Graphs with a Condition at Distance 2
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY