Neighbor sum distinguishing total choice number of planar graphs without 6-cycles
From MaRDI portal
Publication:1995610
DOI10.1007/s10114-020-0144-1zbMath1459.05094OpenAlexW3114848264MaRDI QIDQ1995610
Dong Han Zhang, You Lu, Sheng Gui Zhang
Publication date: 24 February 2021
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-020-0144-1
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (1)
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 colorings of planar graphs
- 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 and list neighbor sum distinguishing total coloring
- 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 distinguishing total coloring of planar graphs without 5-cycles
- Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
- Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs
- Combinatorial Nullstellensatz
This page was built for publication: Neighbor sum distinguishing total choice number of planar graphs without 6-cycles
