L(2,1)-labelings of some families of oriented planar graphs
From MaRDI portal
Publication:2442267
Recommendations
Cites work
- \(L(2,1)\)-labeling of oriented planar graphs
- An oriented coloring of planar graphs with girth at least five
- Distance-two labelings of digraphs
- Good and semi-strong colorings of oriented planar graphs
- Homomorphism bounds for oriented planar graphs
- scientific article; zbMATH DE number 1185300 (Why is no real title available?)
- scientific article; zbMATH DE number 47903 (Why is no real title available?)
- Labelling Graphs with a Condition at Distance 2
- Models and solution techniques for frequency assignment problems
- On nice graphs
- Oriented graph coloring
- The chromatic number of oriented graphs
Cited in
(6)- On \(L(2 , 1)\)-labelings of oriented graphs
- \(L(2,1)\)-labeling of oriented planar graphs
- On oriented \(L(p,1)\)-labeling
- 2-dipath and oriented L(2, 1)-labelings of some families of oriented planar graphs
- Exact square coloring of graphs resulting from some graph operations and products
- The \(L(2,1)\)-labeling on planar graphs
This page was built for publication: \(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 Q2442267)