Neighbor product distinguishing total coloring of planar graphs without 5-cycles

Cites Work

On adjacent-vertex-distinguishing total coloring of graphs
Graph theory with applications
On the total-neighbor-distinguishing index by sums
Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
A note on the neighbor sum distinguishing total coloring of planar graphs
Combinatorial Nullstellensatz
Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
On the neighbor sum distinguishing total coloring of planar graphs
Adjacent vertex distinguishing total colorings of outerplanar graphs
Adjacent vertex distinguishing total colorings of 2-degenerate graphs
Neighbor sum distinguishing total choosability of IC-planar graphs
Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles
Neighbor product distinguishing total colorings
The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)
Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable
Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
Neighbor sum distinguishing total coloring of planar graphs without 4-cycles
Neighbor sums distinguishing total colorings of planar graphs without short cycles
Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten
Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles
Neighbor sum distinguishing total choosability of graphs with larger maximum average degree.
Neighbor product distinguishing total colorings of 2-degenerate graphs
Title not available (Why is that?)

This page was built for publication: Neighbor product distinguishing total coloring of planar graphs without 5-cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6661065)