Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz (Q287913): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10255-016-0583-8 / rank
Normal rank
 
Property / author
 
Property / author: Gui Ying Yan / rank
Normal rank
 
Property / author
 
Property / author: Guang-Hui Wang / rank
Normal rank
 
Property / author
 
Property / author: Gui Ying Yan / rank
 
Normal rank
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.1007/s10255-016-0583-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2344826748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3824455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted-1-antimagic graphs of prime power order / 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: Neighbor sum distinguishing total colorings of \(K_4\)-minor free 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: 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: Total weight choosability of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3575472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The adjacent vertex distinguishing total coloring of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent vertex distinguishing total colorings of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total weight choosability of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antimagic labelling of vertex weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On adjacent-vertex-distinguishing total coloring of graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10255-016-0583-8 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:29, 9 December 2024

scientific article
Language Label Description Also known as
English
Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz
scientific article

    Statements

    Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 May 2016
    0 references
    neighbor sum distinguishing total coloring
    0 references
    combinatorial nullstellensatz
    0 references
    neighbor sum distinguishing total choice number
    0 references
    0 references
    0 references
    0 references

    Identifiers