Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions (Q5035848): 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: Q5422499 / 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 sum distinguishing list total coloring of subcubic 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: Neighbor sum distinguishing total choosability of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein Sechsfarbenproblem auf der Kugel / 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: Neighbor sum distinguishing total choosability of IC-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles / 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 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: Neighbor sum distinguishing total coloring of 2-degenerate graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing total choosability of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List edge and list total coloring of planar graphs without intersecting 8-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing complete multipartite graphs on the plane with restrictions on crossings / rank
 
Normal rank

Latest revision as of 03:18, 28 July 2024

scientific article; zbMATH DE number 7479279
Language Label Description Also known as
English
Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions
scientific article; zbMATH DE number 7479279

    Statements

    Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions (English)
    0 references
    0 references
    22 February 2022
    0 references
    NIC-planar graphs
    0 references
    neighbor sum distinguishing total choice number
    0 references
    combinatorial nullstellensatz
    0 references

    Identifiers