The (2,1)-total labeling number of outerplanar graphs is at most + 2
DOI10.1007/978-3-642-19222-7_11zbMATH Open1326.05131OpenAlexW1663753009MaRDI QIDQ3000498FDOQ3000498
Authors: Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno 
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
Recommendations
- A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs
- \((2,1)\)-total labelling of outerplanar graphs
- Edge coloring by total labelings of outerplanar graphs
- scientific article; zbMATH DE number 5733075
- \((2,1)\)-total labeling of planar graphs with large girth and low maximum degree.
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Labelling Graphs with a Condition at Distance 2
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- A survey on labeling graphs with a condition at distance two
- \((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
- (d,1)-total labeling of graphs with a given maximum average degree
- A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- On \((d,1)\)-total numbers of graphs
Cited In (11)
- \((2,1)\)-total labeling of planar graphs with large girth and low maximum degree.
- Title not available (Why is that?)
- Title not available (Why is that?)
- On \((p,1)\)-total labelling of planar graphs
- \((2,1)\)-total labeling of a class of subcubic graphs
- A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs
- On \((p,1)\)-total labelling of 1-planar graphs
- Labeling outerplanar graphs with maximum degree three
- Edge coloring by total labelings of outerplanar graphs
- Circular Distance Two Labeling and the $\lambda$-Number for Outerplanar Graphs
- \((2,1)\)-total labelling of outerplanar graphs
This page was built for publication: The \((2,1)\)-total labeling number of outerplanar graphs is at most \(\Delta + 2\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000498)
