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

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-012-9470-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4248850250 / 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: Q4552180 / 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: \(L(2,1)\)-labeling of direct product of paths and cycles / 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: 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:46, 6 July 2024

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

    Statements

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