Edge weights and vertex colours: minimizing sum count (Q2334038): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Algorithmic complexity of proper labeling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-coloring edge-weightings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5403005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-coloring edge-weightings: towards the 1-2-3-conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge weights and vertex colours / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard tiling problems with simple tiles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3575472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture / rank
 
Normal rank

Revision as of 21:48, 20 July 2024

scientific article
Language Label Description Also known as
English
Edge weights and vertex colours: minimizing sum count
scientific article

    Statements

    Edge weights and vertex colours: minimizing sum count (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 November 2019
    0 references
    neighbour-sum-distinguishing edge-weightings
    0 references
    number of sums
    0 references

    Identifiers