Neighbor sum distinguishing total choosability of planar graphs
From MaRDI portal
Publication:326491
DOI10.1007/S10878-015-9911-9zbMath1348.05082OpenAlexW599177077MaRDI QIDQ326491
Xiaowei Yu, Cun-quan Qu, Guang-Hui Wang, Gui Ying Yan
Publication date: 12 October 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9911-9
planar graphtotal coloringcombinatorial nullstellensatzdischargingneighbour sum distinguishing total choosability
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (23)
Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions ⋮ Neighbor sum distinguishing list total coloring of IC-planar graphs without 5-cycles ⋮ Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph ⋮ Total coloring of planar graphs without adjacent chordal 6-cycles ⋮ Neighbor sum distinguishing total coloring of planar graphs without 4-cycles ⋮ Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs ⋮ Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10 ⋮ Neighbor sum distinguishing index of sparse graphs ⋮ Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23 ⋮ The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven ⋮ Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10 ⋮ Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24 ⋮ Neighbor sum distinguishing total choosability of cubic graphs ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 ⋮ Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10 ⋮ Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles ⋮ Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers ⋮ Neighbor sum distinguishing total choice number of planar graphs without 6-cycles ⋮ Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles ⋮ Neighbor sum distinguishing total choosability of IC-planar graphs ⋮ Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13 ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8 ⋮ Neighbor sum distinguishing total chromatic number of planar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weighted-1-antimagic graphs of prime power order
- The adjacent vertex distinguishing total chromatic number
- Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
- Neighbor sum distinguishing total colorings of planar graphs
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- List edge and list total colourings of multigraphs
- A note on the adjacent vertex distinguishing total chromatic number of graphs
- The number of edge 3-colorings of a planar cubic graph as a permanent
- On the total-neighbor-distinguishing index by sums
- Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
- 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
- Combinatorial Nullstellensatz
- Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs
- Total weight choosability of graphs
- Total weight choosability of graphs
This page was built for publication: Neighbor sum distinguishing total choosability of planar graphs
