On the adjacent vertex-distinguishing equitable edge coloring of graphs (Q385210): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Adjacent strong edge coloring 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: \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(r\)-strong edge colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence and strong edge colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong edge colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-distinguishing proper edge-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex distinguishing equitable total chromatic number of join graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-distinguishing edge colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The observability of the Fibonacci and the Lucas cubes / 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: Vertex distinguishing colorings of graphs with \(\Delta(G)=2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3070272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3853641 / rank
 
Normal rank

Latest revision as of 02:34, 7 July 2024

scientific article
Language Label Description Also known as
English
On the adjacent vertex-distinguishing equitable edge coloring of graphs
scientific article

    Statements

    On the adjacent vertex-distinguishing equitable edge coloring of graphs (English)
    0 references
    0 references
    0 references
    0 references
    2 December 2013
    0 references
    adjacent vertex-distinguishing edge coloring
    0 references
    adjacent vertex-distinguishing equitable edge coloring
    0 references

    Identifiers