Neighbor product distinguishing total colorings of 2-degenerate graphs
From MaRDI portal
Publication:2292128
DOI10.1007/S10878-019-00455-5zbMATH Open1434.05059OpenAlexW3152206451WikidataQ126992728 ScholiaQ126992728MaRDI QIDQ2292128FDOQ2292128
Authors: Chanjuan Liu, Jiguo Yu, Enqiang Zhu 
Publication date: 3 February 2020
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-019-00455-5
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
- On adjacent-vertex-distinguishing total coloring of graphs
- Graph theory with applications
- Concise proofs for adjacent vertex-distinguishing total colorings
- The adjacent vertex distinguishing total coloring of planar graphs
- On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
- Combinatorial Nullstellensatz
- On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
- Adjacent vertex distinguishing total colorings of 2-degenerate graphs
- 1,2 conjecture-the multiplicative version
- Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
- Multiplicative vertex-colouring weightings of graphs
- Neighbor product distinguishing total colorings
- On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs
Cited In (3)
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)
