Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph (Q2405976): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s11464-017-0649-9 / 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 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: 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: 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: \mbox{\boldmath $\Delta=3$} 的图的邻和可区别全可选性 / 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/S11464-017-0649-9 / rank
 
Normal rank

Latest revision as of 11:13, 18 December 2024

scientific article
Language Label Description Also known as
English
Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph
scientific article

    Statements

    Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph (English)
    0 references
    0 references
    0 references
    26 September 2017
    0 references
    neighbor sum distinguishing total coloring
    0 references
    combinatorial Nullstellensatz
    0 references
    \(K_4\)-minor free graph
    0 references

    Identifiers