\(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs (Q512552): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling bipartite permutation graphs with a condition at distance two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mappings for conflict-free access of paths in bidimensional arrays, circular lists, and complete trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The $L(2,1)$-Labeling Problem on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring the square of the Kneser graph \(\mathrm{KG}(2k+1,k)\) and the Schrijver graph \(\mathrm{SG}(2k+2,k)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(L(p,1)\)-labelling of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 25 pretty graph colouring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(j,k)\)-labelling and maximum ordering-degrees for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kneser's conjecture, chromatic number, and homotopy / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(2,1)\)-labeling of perfect elimination bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(T\)-colorings of graphs: recent results and open problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling Chordal Graphs: Distance Two Condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(2,1)\)-labelings of Cartesian products of two cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(2,1)\)-labelings on the composition of \(n\) graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The L(2,1)-labeling and operations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on labeling graphs with a condition at distance two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular chromatic number: A survey / rank
 
Normal rank

Revision as of 11:12, 13 July 2024

scientific article
Language Label Description Also known as
English
\(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs
scientific article

    Statements

    \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs (English)
    0 references
    0 references
    0 references
    0 references
    27 February 2017
    0 references
    frequency assignment
    0 references
    wireless network
    0 references
    graph coloring
    0 references
    \(L(2,1)\)-labeling
    0 references
    Kneser graph
    0 references
    coloring square of graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references