New upper bounds on the L(2,1)-labeling of the skew and converse skew product graphs
From MaRDI portal
(Redirected from Publication:533885)
New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs
New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs
Recommendations
- Improved upper bounds on the L(2,1)-labeling of the skew and converse skew product graphs
- The \(L(2,1)\)-labeling on the skew and converse skew products of graphs
- \(L(2,1)\)-labelings on some products of \(n\) general graphs.
- L(2,1)-labeling for brick product graphs
- L(2,1)-labelings on the modular product of two graphs
Cites work
- \(L(2,1)\)-labelings on the composition of \(n\) graphs
- \(T\)-colorings of graphs: recent results and open problems
- A survey on labeling graphs with a condition at distance two
- An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees
- Coloring the square of a planar graph
- Graph labeling and radio channel assignment
- scientific article; zbMATH DE number 1185300 (Why is no real title available?)
- scientific article; zbMATH DE number 2197903 (Why is no real title available?)
- Improved upper bounds on the L(2,1)-labeling of the skew and converse skew product graphs
- Labeling Chordal Graphs: Distance Two Condition
- Labelling Graphs with a Condition at Distance 2
- On \((d,1)\)-total numbers of graphs
- On the \(L(p,1)\)-labelling of graphs
- The $L(2,1)$-Labeling Problem on Graphs
- The \(L(2,1)\)-labeling on planar graphs
- The L(2,1)-labelling of trees
- The L(2,1)-labeling and operations of graphs
Cited in
(4)
This page was built for publication: New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q533885)