The (2,1)-total labeling of planar graphs without 5-cycles and 6-cycles

DOI10.3969/J.ISSN.1008-5513.2018.02.13zbMATH Open1424.05259MaRDI QIDQ4625643FDOQ4625643

Authors: Xiao Lv, Lei Sun 

Publication date: 22 February 2019

Recommendations

• \((2,1)\)-total labeling of planar graphs with large girth and low maximum degree.
• On \((p,1)\)-total labelling of planar graphs
• scientific article
• \((p,1)\)-total labelling of graphs
• The maximum degree and \((p,1)\)-total labeling of graphs

zbMATH Keywords

cyclesplanar graph\( (2,1)\)-total labeling

Mathematics Subject Classification ID

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

Cited In (8)

• Title not available (Why is that?)
• (2,1)-total labeling of cube connected cycle
• The maximum degree and \((p,1)\)-total labeling of graphs
• \((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 number of joins of paths and cycles

This page was built for publication: The \( (2,1)\)-total labeling of planar graphs without 5-cycles and 6-cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4625643)