The L(2,1)-labeling on planar graphs

DOI10.1016/J.AML.2006.02.033zbMATH Open1114.05091OpenAlexW2076299112MaRDI QIDQ868019FDOQ868019

Authors: Zhendong Shao, Roger K. Yeh 

Publication date: 19 February 2007

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2006.02.033

Recommendations

• scientific article; zbMATH DE number 2016729
• The List \(L(2, 1)\)-labeling of planar graphs
• \(L(2,1)\)-labeling of oriented planar graphs
• scientific article; zbMATH DE number 2058562
• scientific article; zbMATH DE number 2073985
• scientific article
• The $L(2,1)$-Labeling Problem on Graphs
• \(L(2,1)\)-labelings of some families of oriented planar graphs
• On \((p,1)\)-total labelling of planar graphs
• On list \((2,1)\)-labeling of some planar graphs.

zbMATH Keywords

channel assignmentdistance two graph labeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
• Labelling Graphs with a Condition at Distance 2
• A bound on the chromatic number of the square of a planar graph
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Coloring the square of a planar graph
• The $L(2,1)$-Labeling Problem on Graphs
• Title not available (Why is that?)
• On \(L(d,1)\)-labelings of graphs
• Labeling Chordal Graphs: Distance Two Condition
• A Theorem about the Channel Assignment Problem
• Title not available (Why is that?)
• The L(2,1)-labeling and operations of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (21)

• The \(L(2,1)\)-labeling of planar graphs with maximum degree at most six
• \(L(p,q)\)-labeling of a graph embeddable on the torus
• \(L(p,q)\)-labeling and integer tension of a graph embedded on torus
• New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs
• The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs
• Title not available (Why is that?)
• Distance two labeling on the square of a cycle
• (2,1)-total labelling of planar graphs with large maximum degree
• Title not available (Why is that?)
• The \(L(2,1)\)-labeling on graphs and the frequency assignment problem
• The \(L(p, q)\)-labelling of planar graphs without 4-cycles
• Shorter Labeling Schemes for Planar Graphs
• \(\mathrm L(2,1)\)-labeling of a circular graph.
• Facial \(L(2, 1)\)-edge-labelings of trees
• Adjacency Labelling for Planar Graphs (and Beyond)
• \(L(p,q)\)-labelling of planar graphs with high maximum degree
• Clin d'oeil on \(L_1\)-embeddable planar graphs
• Title not available (Why is that?)
• A note on \(l_ 1\)-rigid planar graphs
• Labeling planar graphs with a condition at distance two
• \(L(2,1)\)-labelings on the modular product of two graphs

This page was built for publication: The \(L(2,1)\)-labeling on planar graphs

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