A relaxed case on 1-2-3 conjecture (Q2631083): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Vertex colouring edge partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-colouring edge-weightings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree constrained subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum average degree and the oriented chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new type of edge-derived vertex coloring / 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: Bounding the weight choosability number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplicative vertex-colouring weightings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On vertex-coloring 13-edge-weighting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs / rank
 
Normal rank

Latest revision as of 09:13, 12 July 2024

scientific article
Language Label Description Also known as
English
A relaxed case on 1-2-3 conjecture
scientific article

    Statements

    A relaxed case on 1-2-3 conjecture (English)
    0 references
    28 July 2016
    0 references
    0 references
    vertex-coloring edge-weighting
    0 references
    tree-coloring
    0 references
    tree-coloring edge-weighting
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references