Neighbor product distinguishing total colorings of 2-degenerate graphs
From MaRDI portal
Publication:2292128
Recommendations
- Neighbor product distinguishing total colorings
- Neighbor sum distinguishing total coloring of 2-degenerate graphs
- Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring
- Neighbor sum distinguishing total chromatic number of 2-degenerate graphs
- Adjacent vertex distinguishing total colorings of 2-degenerate graphs
Cites work
- 1,2 conjecture-the multiplicative version
- Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
- Adjacent vertex distinguishing total colorings of 2-degenerate graphs
- Combinatorial Nullstellensatz
- Concise proofs for adjacent vertex-distinguishing total colorings
- Graph theory with applications
- Multiplicative vertex-colouring weightings of graphs
- Neighbor product distinguishing total colorings
- On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs
- On adjacent-vertex-distinguishing total coloring of graphs
- On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
- On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
- The adjacent vertex distinguishing total coloring of planar graphs
Cited in
(4)
This page was built for publication: Neighbor product distinguishing total colorings of 2-degenerate graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292128)