The (2,1)-total labeling number of outerplanar graphs is at most + 2

DOI10.1007/978-3-642-19222-7_11MaRDI QIDQ3000498zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

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.

Cites work

• (d,1)-total labeling of graphs with a given maximum average degree
• A survey on labeling graphs with a condition at distance two
• A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs
• Labelling Graphs with a Condition at Distance 2
• On \((d,1)\)-total numbers of graphs
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• \((2,1)\)-total labelling of outerplanar graphs
• \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree
• \((p,1)\)-total labelling of graphs

Cited in

(11)

• Circular Distance Two Labeling and the $\lambda$-Number for Outerplanar Graphs
• \((2,1)\)-total labelling of outerplanar graphs
• \((2,1)\)-total labeling of planar graphs with large girth and low maximum degree.
• scientific article; zbMATH DE number 5811532 (Why is no real title available?)
• scientific article; zbMATH DE number 5733075 (Why is no real title available?)
• 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
• Edge coloring by total labelings of outerplanar graphs
• Labeling outerplanar graphs with maximum degree three

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)