On weight choosabilities of graphs with bounded maximum average degree (Q516900): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Combinatorial Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weight choosability of graphs / 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: How to Define an Irregular Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3824455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3474681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graph irregularity strength / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873220 / 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: A New Upper Bound for the Irregularity Strength of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge weights and vertex colours / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Irregularity Strength of Dense Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Bound on the Irregularity Strength of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irregularity strength of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decomposing graphs of large minimum degree into locally irregular subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3575472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total weight choosability of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total weight choosability of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every graph is \((2,3)\)-choosable / rank
 
Normal rank

Latest revision as of 13:56, 13 July 2024

scientific article
Language Label Description Also known as
English
On weight choosabilities of graphs with bounded maximum average degree
scientific article

    Statements

    On weight choosabilities of graphs with bounded maximum average degree (English)
    0 references
    0 references
    0 references
    0 references
    15 March 2017
    0 references
    0 references
    1-2-3 conjecture
    0 references
    1-2-conjecture
    0 references
    \(3\)-edge-weight choosability
    0 references
    2-total weight choosability
    0 references
    combinatorial Nullstellensatz
    0 references
    discharging method
    0 references
    maximum average degree
    0 references
    0 references