The minimum span of \(L(2,1)\)-labelings of generalized flowers (Q479033): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q887136
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Nathaniel J. Karst / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2014.10.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1995658966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(L(2,1)\)-labelings of amalgamations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(p,q)\)-labeling of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling Products of Complete Graphs with a Condition at Distance Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating path coverings to vertex labellings 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: Graph labeling and radio channel assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(L(2,1)\)-labelings of Cartesian products of paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic labellings with constraints at two distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling outerplanar graphs with maximum degree three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5466031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path covering number and \(L(2,1)\)-labeling number of graphs / 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 modular product of two graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the $\lambda$-Number of $Q_n $ and Related Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling graphs with the circular difference / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on labeling graphs with a condition at distance two / rank
 
Normal rank

Latest revision as of 10:26, 9 July 2024

scientific article
Language Label Description Also known as
English
The minimum span of \(L(2,1)\)-labelings of generalized flowers
scientific article

    Statements

    The minimum span of \(L(2,1)\)-labelings of generalized flowers (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 December 2014
    0 references
    \(L(d,1)\)-labeling
    0 references
    circular \(L(d,1)\)-labeling
    0 references
    amalgamation
    0 references
    Cartesian product
    0 references
    0 references
    0 references
    0 references

    Identifiers