scientific article; zbMATH DE number 5733075
From MaRDI portal
Publication:3570849
Recommendations
- \((2,1)\)-total labelling of outerplanar graphs
- (2,1)-total labelling of planar graphs with large maximum degree
- Labeling outerplanar graphs with maximum degree three
- The \((2,1)\)-total labeling number of outerplanar graphs is at most \(\Delta + 2\)
- A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs
- scientific article; zbMATH DE number 5811532
- (d,1)-total labelling of planar graphs with large girth and high maximum degree
- On \((p,1)\)-total labelling of planar graphs
- (2,1)-total labeling of planar graphs with large girth and low maximum degree.
- scientific article; zbMATH DE number 2058562
Cited in
(12)- (d,1)-total labelling of planar graphs with large girth and high maximum degree
- \((2,1)\)-total labelling of outerplanar graphs
- The \((2,1)\)-total labeling number of outerplanar graphs is at most \(\Delta + 2\)
- The maximum degree and (p,1)-total labeling of graphs
- (2,1)-total labeling of cube connected cycle
- (2,1)-total labeling of a class of subcubic graphs
- Edge coloring by total labelings of outerplanar graphs
- A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs
- The (2,1)-total labeling of planar graphs without 5-cycles and 6-cycles
- (2,1)-total labelling of planar graphs with large maximum degree
- On \((p,1)\)-total labelling of planar graphs
- On zonal and inner zonal labelings of plane graphs of maximum degree 3
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3570849)
