Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz (Q5962524): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2015.08.028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1937159104 / 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: Irregular Assignments of Trees and Forests / 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 the irregularity strength of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Neighbor Sum Distinguishing Index of Planar Graphs / 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: Irregularity strength of dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the irregularity strength of them ×n grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3474681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing index / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graph irregularity strength / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number / 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: 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: Q4873753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing total colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs / 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 bound on the total chromatic number / 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: On the total-neighbor-distinguishing index by sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically optimal neighbour sum distinguishing colourings 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: Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited / 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: SOME UNSOLVED PROBLEMS IN GRAPH THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing index of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every graph is \((2,3)\)-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total weight choosability of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent strong edge coloring of graphs / rank
 
Normal rank

Latest revision as of 10:20, 11 July 2024

scientific article; zbMATH DE number 6541334
Language Label Description Also known as
English
Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz
scientific article; zbMATH DE number 6541334

    Statements

    Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz (English)
    0 references
    0 references
    12 February 2016
    0 references
    total neighbour sum distinguishing number
    0 references
    list total colouring
    0 references
    combinatorial nullstellensatz
    0 references
    adjacent strong chromatic index
    0 references
    neighbour sum distinguishing index
    0 references
    1-2-conjecture
    0 references
    graph labelling
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers