Neighbor sum distinguishing total coloring of planar graphs without 4-cycles (Q1679510): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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 distinguishing total colorings of planar graphs with maximum degree \(\varDelta\) / 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: 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 total-neighbor-distinguishing index by sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz / 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: Neighbor sum distinguishing total choosability 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: Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs / 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: A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \mbox{\boldmath $\Delta=3$} 的图的邻和可区别全可选性 / rank
 
Normal rank

Latest revision as of 17:21, 14 July 2024

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

    Statements

    Neighbor sum distinguishing total coloring of planar graphs without 4-cycles (English)
    0 references
    0 references
    0 references
    9 November 2017
    0 references
    neighbor sum distinguishing total coloring
    0 references
    combinatorial nullstellensatz
    0 references
    planar graph
    0 references
    0 references

    Identifiers