Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs (Q2631097): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-015-1646-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2108756413 / 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: 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 of planar graphs with maximum degree \(\varDelta\) / 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 distinguishing total colorings of graphs with bounded maximum average degree / 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: Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs / 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: Neighbor sum distinguishing total coloring of 2-degenerate graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On adjacent-vertex-distinguishing total coloring of graphs / rank
 
Normal rank

Latest revision as of 08:13, 12 July 2024

scientific article
Language Label Description Also known as
English
Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs
scientific article

    Statements

    Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 July 2016
    0 references
    neighbor sum (set)~~distinguishing total coloring
    0 references
    adjacent vertex distinguishing total coloring
    0 references
    \(d\)-degenerate graph
    0 references
    List total coloring
    0 references
    combinatorial Nullstellensatz
    0 references

    Identifiers