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

zbMATH Open1274.05108MaRDI QIDQ2857442FDOQ2857442

Authors: Sagnik Sen 

Publication date: 1 November 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065311001958

Recommendations

• \(L(2,1)\)-labelings of some families of oriented planar graphs
• \(L(2,1)\)-labeling of oriented planar graphs
• On oriented \(L(p,1)\)-labeling
• \((2,1)\)-total labeling of planar graphs with large girth and low maximum degree.
• On \(L(2 , 1)\)-labelings of oriented graphs

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Labelling Graphs with a Condition at Distance 2
• Models and solution techniques for frequency assignment problems
• Title not available (Why is that?)
• On nice graphs
• \(L(2,1)\)-labeling of oriented planar graphs
• Distance-two labelings of digraphs

Cited In (3)

• The 2-dipath chromatic number of Halin graphs
• \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles
• Title not available (Why is that?)

Uses Software

• CALMA

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

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