L(2,1)-labeling of Kneser graphs and coloring squares of Kneser graphs
DOI10.1016/J.DAM.2017.01.003zbMATH Open1356.05128OpenAlexW2582332404MaRDI QIDQ512552FDOQ512552
Roberto Solis-Oba, Igor Averbakh, Zhendong Shao
Publication date: 27 February 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.01.003
Recommendations
- scientific article; zbMATH DE number 2091962
- The \(L (3, 2, 1)\)-labeling problem on graphs
- The \(L(2,1)\)-labeling on graphs and the frequency assignment problem
- Coloring the square of the Kneser graph \(\mathrm{KG}(2k+1,k)\) and the Schrijver graph \(\mathrm{SG}(2k+2,k)\)
- The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications
graph coloringKneser graphwireless networkfrequency assignment\(L(2,1)\)-labelingcoloring square of graphs
Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Kneser's conjecture, chromatic number, and homotopy
- On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
- \(T\)-colorings of graphs: recent results and open problems
- Labelling Graphs with a Condition at Distance 2
- A survey on labeling graphs with a condition at distance two
- 25 pretty graph colouring problems
- The $L(2,1)$-Labeling Problem on Graphs
- Circular chromatic number: A survey
- Title not available (Why is that?)
- On the \(L(p,1)\)-labelling of graphs
- \(L(2,1)\)-labelings of Cartesian products of two cycles
- Labeling Chordal Graphs: Distance Two Condition
- The L(2,1)-labeling and operations of graphs
- \(L(2,1)\)-labelings on the composition of \(n\) graphs
- Coloring the square of the Kneser graph \(\mathrm{KG}(2k+1,k)\) and the Schrijver graph \(\mathrm{SG}(2k+2,k)\)
- Labeling bipartite permutation graphs with a condition at distance two
- The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs
- \(L(j,k)\)-labelling and maximum ordering-degrees for trees
- \(L(2,1)\)-labeling of perfect elimination bipartite graphs
- Mappings for conflict-free access of paths in bidimensional arrays, circular lists, and complete trees
Cited In (4)
- Coloring the square of the Kneser graph \(\mathrm{KG}(2k+1,k)\) and the Schrijver graph \(\mathrm{SG}(2k+2,k)\)
- A note on the chromatic number of the square of Kneser graph \(K(2 k + 1, k)\)
- Title not available (Why is that?)
- \(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs
This page was built for publication: \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q512552)
