\(L(2,1)\)-labeling of oriented planar graphs (Q2446298): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q324804
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Blerina Sinaimeri / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CALMA / 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.2012.07.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2111452990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and solution techniques for frequency assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-two labelings of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5466046 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(p,q)\)-labeling of digraphs / 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: Labelling Graphs with a Condition at Distance 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-dipath chromatic number of Halin graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the chromatic number of the square of a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorings and girth of oriented planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Good and semi-strong colorings of oriented planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring the square of a planar graph / 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:43, 8 July 2024

scientific article
Language Label Description Also known as
English
\(L(2,1)\)-labeling of oriented planar graphs
scientific article

    Statements

    \(L(2,1)\)-labeling of oriented planar graphs (English)
    0 references
    0 references
    0 references
    16 April 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    \(L(h,k)\)-labeling
    0 references
    oriented graphs
    0 references
    prisms
    0 references
    Halin graphs
    0 references
    cacti
    0 references
    0 references