Linear and cyclic distance-three labellings of trees (Q741540): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2093421838 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1309.1545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate <i>L</i>(δ<sub>1</sub>,δ<sub>2</sub>,…,δ<sub><i>t</i></sub>)‐coloring of trees and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(h,1,1)\)-labeling of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling trees with a condition at distance two / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(L(d,1)\)-labelings of graphs / 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: No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-two labellings of Hamming graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance three labelings of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838194 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized Petersen graphs labeled with a condition at distance two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling trees with a condition at distance two. / 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: Griggs and Yeh's Conjecture and $L(p,1)$-labelings / rank
 
Normal rank
Property / cites work
 
Property / cites work: $L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance three labelings for direct products of three complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(L(h,1,1)\)-labelling problem for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity and circular distance two labellings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling Chordal Graphs: Distance Two Condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph labeling and radio channel assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: A channel assignment problem for optical networks modelled by Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling Cayley Graphs on Abelian Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distance-labelling problem for hypercubes / rank
 
Normal rank

Latest revision as of 01:41, 9 July 2024

scientific article
Language Label Description Also known as
English
Linear and cyclic distance-three labellings of trees
scientific article

    Statements

    Linear and cyclic distance-three labellings of trees (English)
    0 references
    0 references
    12 September 2014
    0 references
    channel assignment
    0 references
    frequency assignment
    0 references
    distance-three labelling
    0 references
    cyclic labelling
    0 references
    \(\lambda\)-number
    0 references
    \(\sigma\)-number
    0 references
    tree
    0 references
    complete \(m\)-ary tree
    0 references
    0 references
    0 references

    Identifiers

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