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

DOI10.1016/J.AML.2006.02.033MaRDI QIDQ868019zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

channel assignmentdistance two graph labeling

Mathematics Subject Classification ID

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

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; zbMATH DE number 5811532
• 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.

Cites work

• scientific article; zbMATH DE number 3657692 (Why is no real title available?)
• scientific article; zbMATH DE number 1500531 (Why is no real title available?)
• scientific article; zbMATH DE number 1792593 (Why is no real title available?)
• scientific article; zbMATH DE number 1409224 (Why is no real title available?)
• scientific article; zbMATH DE number 1420920 (Why is no real title available?)
• A Theorem about the Channel Assignment Problem
• A bound on the chromatic number of the square of a planar graph
• Coloring the square of a planar graph
• Labeling Chordal Graphs: Distance Two Condition
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Labelling Graphs with a Condition at Distance 2
• On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
• On \(L(d,1)\)-labelings of graphs
• The $L(2,1)$-Labeling Problem on Graphs
• The L(2,1)-labeling and operations of graphs

Cited in

(21)

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

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)