\(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs (Q2352348): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-013-9632-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2168444394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs / 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: \((p,q)\)-total labeling of complete graphs / 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: Q3838194 / 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: \((p,1)\)-total labelling of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance two edge labelings of lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: L(2,1)-Edge-Labelings of the Edge-Path-Replacement of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group path covering and \(L(j,k)\)-labelings of diameter two graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular \(L(j,k)\)-labeling number of direct product of path and cycle / 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: A note on \(L (2, 1)\)-labelling of trees / rank
 
Normal rank

Latest revision as of 11:42, 10 July 2024

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

    Statements

    \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 July 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    \(L(2,1)\)-labeling
    0 references
    \(L(d,1)\)-labeling
    0 references
    \(L(d,1)\)-total labeling
    0 references
    edge-path-replacement
    0 references
    factorization of graphs
    0 references
    0 references