The algorithm for adjacent vertex distinguishing proper edge coloring of graphs (Q2788720): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4028414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent Vertex Distinguishing Edge‐Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5480704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the vertex-distinguishing proper edge-colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-distinguishing proper edge-colorings / 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: Q2857387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on adjacent strong edge coloring of \(K(n,m)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong edge colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent vertex distinguishing total coloring of graphs with lower average degree / 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: Adjacent strong edge coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s1793830915500445 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1844520552 / rank
 
Normal rank

Latest revision as of 09:23, 30 July 2024

scientific article
Language Label Description Also known as
English
The algorithm for adjacent vertex distinguishing proper edge coloring of graphs
scientific article

    Statements

    The algorithm for adjacent vertex distinguishing proper edge coloring of graphs (English)
    0 references
    0 references
    0 references
    0 references
    22 February 2016
    0 references
    graph
    0 references
    algorithm
    0 references
    adjacent vertex distinguishing proper edge coloring
    0 references
    adjacent vertex distinguishing proper edge chromatic number
    0 references

    Identifiers