On the hole index of L(2,1)-labelings of r-regular graphs
From MaRDI portal
(Redirected from Publication:2457022)
On the hole index of \(L(2,1)\)-labelings of \(r\)-regular graphs
On the hole index of \(L(2,1)\)-labelings of \(r\)-regular graphs
Recommendations
Cites work
- A note on collections of graphs with non-surjective lambda labelings
- A survey on labeling graphs with a condition at distance two
- Construction of Large Graphs with No Optimal Surjective L(2,1)-Labelings
- Full Color Theorems for L(2,1)-Colorings
- Labelling Graphs with a Condition at Distance 2
- No-hole \(L(2,1)\)-colorings
- On the Structure of Graphs with Non-Surjective L(2,1)-Labelings
- Relating path coverings to vertex labellings with a condition at distance two
Cited in
(6)- A new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic number
- Labeling matched sums with a condition at distance two
- Path covering number and \(L(2,1)\)-labeling number of graphs
- Hole: An Emerging Character in the Story of Radio k-Coloring Problem
- The L(d,1)-hole index of paths and cycles
- On island sequences of labelings with a condition at distance two
This page was built for publication: On the hole index of \(L(2,1)\)-labelings of \(r\)-regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2457022)