The List L(2, 1)-labeling of planar graphs
From MaRDI portal
Recommendations
- The list \(L(2,1)\)-labeling of planar graphs with large girth
- Optimal frequency assignment and planar list \(L(2, 1)\)-labeling
- On list \((2,1)\)-labeling of some planar graphs.
- Labeling planar graphs with a condition at distance two
- The \(L(2,1)\)-labeling of planar graphs with maximum degree at most six
Cites work
- scientific article; zbMATH DE number 6004909 (Why is no real title available?)
- A Theorem about the Channel Assignment Problem
- A bound on the chromatic number of the square of a planar graph
- Coloring the square of a planar graph
- Colorings and orientations of graphs
- Distance constrained labelings of planar graphs with no short cycles
- Edge-partitions of planar graphs and their game coloring numbers
- Graph theory with applications
- Griggs and Yeh's conjecture and \(L(p,1)\)-labelings
- Labeling planar graphs with a condition at distance two
- Labeling planar graphs without 4,5-cycles with a condition on distance two
- Labelling Graphs with a Condition at Distance 2
- List edge and list total colourings of multigraphs
- On the \(L(p,1)\)-labelling of graphs
- The L(2,1)-labelling of trees
- The L(p, q)-labelling of planar graphs without 4-cycles
Cited in
(13)- The \(L(2,1)\)-labeling on planar graphs
- scientific article; zbMATH DE number 2016729 (Why is no real title available?)
- On list chromatic number of \(L(2,0)\)-labeling of a complete bipartite graph \(K_{2,n}\)
- The List \(L (p,q)\)-labelings of planar graphs with high maximum degree
- The list \(L(2,1)\)-labeling of planar graphs with large girth
- On list \((2,1)\)-labeling of some planar graphs.
- Improper choosability of graphs and maximum average degree
- The \(L (2,1)\)-choosability of cycle
- Two results on \(k\)-\((2,1)\)-total choosability of planar graphs
- A result on \(K\)-\((2,1)\)-total choosability of planar graphs
- Coloring squares of planar graphs with maximum degree at most five
- On list \((p, 1)\)-total labellings of special planar graphs and 1-planar graphs
- Optimal frequency assignment and planar list \(L(2, 1)\)-labeling
This page was built for publication: The List \(L(2, 1)\)-labeling of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1637136)