Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles (Q501651): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On adjacent-vertex-distinguishing total coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The adjacent vertex distinguishing total coloring of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent vertex distinguishing total colorings of outerplanar 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 colorings of graphs with bounded maximum average degree / 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 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 planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent vertex distinguishing total colorings of 2-degenerate 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 distinguishing total choosability of planar graphs without 4-cycles / 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: Combinatorial Nullstellensatz / rank
 
Normal rank

Latest revision as of 06:13, 13 July 2024

scientific article
Language Label Description Also known as
English
Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles
scientific article

    Statements

    Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles (English)
    0 references
    0 references
    0 references
    0 references
    9 January 2017
    0 references
    neighbor sum distinguishing total coloring
    0 references
    choosability
    0 references
    combinatorial Nullstellensatz
    0 references
    planar graph
    0 references

    Identifiers