Neighbor sum distinguishing total choosability of cubic graphs (Q2227993): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00373-020-02196-3 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-020-02196-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3033785580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / 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 coloring of graphs with bounded treewidth / 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: Neighbor sum distinguishing list total coloring of subcubic 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: Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing total choosability of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing total coloring of sparse IC-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing total choosability of planar graphs without 4-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing total chromatic number of 2-degenerate graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing total chromatic number of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00373-020-02196-3 / rank
 
Normal rank

Latest revision as of 10:13, 28 December 2024

scientific article
Language Label Description Also known as
English
Neighbor sum distinguishing total choosability of cubic graphs
scientific article

    Statements

    Neighbor sum distinguishing total choosability of cubic graphs (English)
    0 references
    0 references
    0 references
    0 references
    16 February 2021
    0 references
    cubic graphs
    0 references
    neighbor sum distinguishing total choosability
    0 references
    combinatorial Nullstellensatz
    0 references

    Identifiers