An oriented version of the 1-2-3 conjecture (Q2259576): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.7151/dmgt.1791 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2018586054 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q123313735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1,2 conjecture-the multiplicative version / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Weight choosability of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring chip configurations on graphs and digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraphs are 2-weight choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge weights and vertex colours / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decomposing regular graphs into locally irregular subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex colouring edge partitions / rank
 
Normal rank

Latest revision as of 19:32, 9 July 2024

scientific article
Language Label Description Also known as
English
An oriented version of the 1-2-3 conjecture
scientific article

    Statements

    An oriented version of the 1-2-3 conjecture (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 March 2015
    0 references
    0 references
    oriented graph
    0 references
    neighbour-sum-distinguishing arc-weighting
    0 references
    complexity
    0 references
    1-2-3 conjecture
    0 references
    0 references
    0 references