Neighbor-distinguishing \(k\)-tuple edge-colorings of graphs (Q1044992): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2009.04.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034953539 / rank
 
Normal rank

Revision as of 03:15, 20 March 2024

scientific article
Language Label Description Also known as
English
Neighbor-distinguishing \(k\)-tuple edge-colorings of graphs
scientific article

    Statements

    Neighbor-distinguishing \(k\)-tuple edge-colorings of graphs (English)
    0 references
    0 references
    0 references
    15 December 2009
    0 references
    graph
    0 references
    \(k\)-tuple edge-coloring
    0 references
    neighbor-distinguishing
    0 references
    adjacent vertex-distinguishing
    0 references
    fractional coloring
    0 references
    circular coloring
    0 references

    Identifiers