\(L(2,1)\)-labelings of some families of oriented planar graphs
From MaRDI portal
Publication:2442267
DOI10.7151/dmgt.1713zbMath1292.05228MaRDI QIDQ2442267
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
homomorphism; girth; planar graph; partial \(k\)-tree; \(L(2,1)\)-labeling; cactus; outerplanar graph; 2-dipath; oriented \(L(2,1)\)-labeling
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Related Items
Uses Software
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