Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles (Q2186285): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q977288
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Wei Fan Wang / 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.1007/s40840-019-00860-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2990425179 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126560571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(r\)-strong edge colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent Vertex Distinguishing Edge‐Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent vertex distinguishing indices of planar graphs without 3-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent strong edge coloring of graphs / rank
 
Normal rank

Latest revision as of 21:54, 22 July 2024

scientific article
Language Label Description Also known as
English
Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles
scientific article

    Statements

    Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 June 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    adjacent vertex distinguishing edge coloring
    0 references
    planar graph
    0 references
    cycle
    0 references
    0 references
    0 references