Neighbor sum distinguishing total coloring of 2-degenerate graphs
From MaRDI portal
Publication:2410029
DOI10.1007/S10878-016-0053-5zbMath1394.05037OpenAlexW2472977784MaRDI QIDQ2410029
Changqing Xu, Jingjing Yao, Xiaowei Yu, Guang-Hui Wang
Publication date: 17 October 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-016-0053-5
lexicographic orderneighbor sum distinguishing total coloringcombinatorial Nullstellensatz2-degenerate graph
Related Items (9)
Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions ⋮ Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs ⋮ Neighbor sum distinguishing total coloring of planar graphs without 5-cycles ⋮ Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10 ⋮ Neighbor sum distinguishing list total coloring of subcubic graphs ⋮ Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles ⋮ Neighbor sum distinguishing total colorings of corona of subcubic graphs ⋮ Locating-Domination and Identification ⋮ Neighbor sum distinguishing total chromatic number of planar graphs
Cites Work
- Unnamed Item
- Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
- Neighbor sum distinguishing total colorings of planar graphs
- On the neighbor sum distinguishing total coloring of planar graphs
- Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
- The adjacent vertex distinguishing total coloring of planar graphs
- Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
- Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
- On adjacent-vertex-distinguishing total coloring of graphs
- Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs
- Combinatorial Nullstellensatz
- Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs
This page was built for publication: Neighbor sum distinguishing total coloring of 2-degenerate graphs