L(2,1)-labeling of Kneser graphs and coloring squares of Kneser graphs

DOI10.1016/J.DAM.2017.01.003MaRDI QIDQ512552zbMATH OpenOpenAlexFDO

Authors Zhendong Shao, Igor Averbakh, Roberto Solis-Oba

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

zbMATH Keywords

graph coloringKneser graphwireless networkfrequency assignment\(L(2,1)\)-labelingcoloring square of graphs

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 1409224 (Why is no real title available?)
• 25 pretty graph colouring problems
• A survey on labeling graphs with a condition at distance two
• Circular chromatic number: A survey
• Coloring the square of the Kneser graph \(\mathrm{KG}(2k+1,k)\) and the Schrijver graph \(\mathrm{SG}(2k+2,k)\)
• Kneser's conjecture, chromatic number, and homotopy
• Labeling Chordal Graphs: Distance Two Condition
• Labeling bipartite permutation graphs with a condition at distance two
• Labelling Graphs with a Condition at Distance 2
• Mappings for conflict-free access of paths in bidimensional arrays, circular lists, and complete trees
• On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
• On the \(L(p,1)\)-labelling of graphs
• The $L(2,1)$-Labeling Problem on Graphs
• The L(2,1)-labeling and operations of graphs
• The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs
• \(L(2,1)\)-labeling of perfect elimination bipartite graphs
• \(L(2,1)\)-labelings of Cartesian products of two cycles
• \(L(2,1)\)-labelings on the composition of \(n\) graphs
• \(L(j,k)\)-labelling and maximum ordering-degrees for trees
• \(T\)-colorings of graphs: recent results and open problems

Cited in

(4)

• \(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs
• Coloring the square of the Kneser graph \(\mathrm{KG}(2k+1,k)\) and the Schrijver graph \(\mathrm{SG}(2k+2,k)\)
• scientific article; zbMATH DE number 749300 (Why is no real title available?)
• A note on the chromatic number of the square of Kneser graph \(K(2 k + 1, k)\)

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)