\(L(2,1)\)-labeling of oriented planar graphs

DOI10.1016/j.dam.2012.07.009zbMath1287.05132OpenAlexW2111452990MaRDI QIDQ2446298

Tiziana Calamoneri, Blerina Sinaimeri

Publication date: 16 April 2014

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

Full work available at URL: https://doi.org/10.1016/j.dam.2012.07.009

zbMATH Keywords

oriented graphsHalin graphscactiprisms\(L(h,k)\)-labeling

Mathematics Subject Classification ID

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

Related Items

\(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles, Exact square coloring of graphs resulting from some graph operations and products, \(L(2,1)\)-labelings of some families of oriented planar graphs, Unnamed Item, On \(L(2 , 1)\)-labelings of oriented graphs

Uses Software

• CALMA

Cites Work

• Unnamed Item
• The 2-dipath chromatic number of Halin graphs
• Distance-two labelings of digraphs
• \(L(p,q)\)-labeling of digraphs
• Good and semi-strong colorings of oriented planar graphs
• Colorings and girth of oriented planar graphs
• Labeling trees with a condition at distance two.
• A bound on the chromatic number of the square of a planar graph
• A survey on labeling graphs with a condition at distance two
• Labelling Graphs with a Condition at Distance 2
• Coloring the square of a planar graph
• Models and solution techniques for frequency assignment problems