\(L(2,1)\)-labelings of some families of oriented planar graphs

DOI10.7151/DMGT.1713zbMath1292.05228OpenAlexW2069281059MaRDI QIDQ2442267

Sagnik Sen

Publication date: 2 April 2014

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1713

zbMATH Keywords

homomorphismgirthplanar graphpartial \(k\)-tree\(L(2,1)\)-labelingcactusouterplanar graph2-dipathoriented \(L(2,1)\)-labeling

Mathematics Subject Classification ID

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

Related Items (1)

Exact square coloring of graphs resulting from some graph operations and products

Uses Software

• CALMA

Cites Work

• Unnamed Item
• Unnamed Item
• Distance-two labelings of digraphs
• An oriented coloring of planar graphs with girth at least five
• Good and semi-strong colorings of oriented planar graphs
• \(L(2,1)\)-labeling of oriented planar graphs
• Labelling Graphs with a Condition at Distance 2
• The chromatic number of oriented graphs
• Homomorphism bounds for oriented planar graphs
• Models and solution techniques for frequency assignment problems
• Oriented graph coloring
• On nice graphs

This page was built for publication: \(L(2,1)\)-labelings of some families of oriented planar graphs