Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve (Q2292141): 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: On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The adjacent vertex distinguishing total chromatic number / 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: A note on the adjacent vertex distinguishing total chromatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concise proofs for adjacent vertex-distinguishing total colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent vertex distinguishing total coloring of graphs with maximum degree 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the AVDTC of 4-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\) / 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: Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable / 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: On adjacent-vertex-distinguishing total coloring of graphs / rank
 
Normal rank

Revision as of 16:19, 21 July 2024

scientific article
Language Label Description Also known as
English
Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve
scientific article

    Statements

    Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 February 2020
    0 references
    0 references
    planar graph
    0 references
    neighbor-distinguishing total coloring
    0 references
    discharging
    0 references
    combinatorial nullstellensatz
    0 references
    0 references