Neighbor sum distinguishing total coloring of planar graphs without 5-cycles (Q2402272): 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.1016/j.tcs.2017.05.037 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2625701133 / 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: Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz / 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: Q2829032 / 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 neighbor sum distinguishing total coloring of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the neighbor sum distinguishing total coloring of 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 colorings of triangle free planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2828964 / 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: Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs / rank
 
Normal rank

Latest revision as of 09:28, 14 July 2024

scientific article
Language Label Description Also known as
English
Neighbor sum distinguishing total coloring of planar graphs without 5-cycles
scientific article

    Statements

    Neighbor sum distinguishing total coloring of planar graphs without 5-cycles (English)
    0 references
    0 references
    0 references
    0 references
    7 September 2017
    0 references
    neighbor sum distinguishing total coloring
    0 references
    combinatorial Nullstellensatz
    0 references
    planar graph
    0 references

    Identifiers