\(L(d,1)\)-labelings of the edge-path-replacement of a graph (Q386438): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-012-9487-6 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Total colorings of planar graphs with large maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: List edge and list total colourings of multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total colourings of planar graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On labeling the vertices of products of complete graphs with distance constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838194 / 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: Labelling Graphs with a Condition at Distance 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On unavoidability of trees with \(k\) leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((p,1)\)-total labelling of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment] / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(2,1)\)-labeling of direct product of paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552180 / 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: \(L(2, 1)\)-labelings of the edge-path-replacement of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the total coloring of certain 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: On Total Chromatic Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the $\lambda$-Number of $Q_n $ and Related Graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10878-012-9487-6 / rank
 
Normal rank

Latest revision as of 16:04, 9 December 2024

scientific article
Language Label Description Also known as
English
\(L(d,1)\)-labelings of the edge-path-replacement of a graph
scientific article

    Statements

    \(L(d,1)\)-labelings of the edge-path-replacement of a graph (English)
    0 references
    0 references
    0 references
    9 December 2013
    0 references
    channel assignment
    0 references
    \(L(j,k)\)-labeling
    0 references
    \((d,1)\)-total labeling
    0 references
    edge-path-replacement
    0 references

    Identifiers