Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13 (Q2292143): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Chromatic number, independence ratio, and crossing number / 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 (set) distinguishing total choosability 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: Asymptotically optimal neighbor sum distinguishing total colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring / 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 sum distinguishing total choosability of planar 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: Neighbor sum distinguishing total choosability of IC-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: 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 chromatic number of \(K_4\)-minor free graph / 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 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 / cites work
 
Property / cites work: On total colorings of 1-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List edge and list total coloring of 1-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On edge colorings of \(1\)-planar graphs / rank
 
Normal rank

Latest revision as of 15:19, 21 July 2024

scientific article
Language Label Description Also known as
English
Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13
scientific article

    Statements

    Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13 (English)
    0 references
    0 references
    0 references
    3 February 2020
    0 references
    neighbor sum distinguishing total coloring
    0 references
    IC-planar graph
    0 references
    discharging method
    0 references
    0 references

    Identifiers