Neighbor sum distinguishing total choosability of cubic graphs
From MaRDI portal
Publication:2227993
DOI10.1007/s00373-020-02196-3zbMath1458.05086OpenAlexW3033785580MaRDI QIDQ2227993
You Lu, Dong Han Zhang, Sheng Gui Zhang
Publication date: 16 February 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-020-02196-3
Related Items
Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions, Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10
Cites Work
- Unnamed Item
- Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
- Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz
- Neighbor sum distinguishing total choosability of planar graphs
- Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles
- Neighbor sum distinguishing total coloring of graphs with bounded treewidth
- Neighbor sum distinguishing total chromatic number of 2-degenerate graphs
- Neighbor sum distinguishing total coloring of sparse IC-planar graphs
- Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10
- Neighbor sum distinguishing list total coloring of subcubic graphs
- Neighbor sum distinguishing total chromatic number of planar graphs
- On the total-neighbor-distinguishing index by sums
- Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
- Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
- Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs
- Combinatorial Nullstellensatz