Neighbor sum distinguishing total choosability of planar graphs

DOI10.1007/S10878-015-9911-9zbMATH Open1348.05082OpenAlexW599177077MaRDI QIDQ326491FDOQ326491

Authors: Xiaowei Yu, Cun-quan Qu, Guanghui Wang, Guiying 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

Recommendations

• Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles
• Neighbor sum distinguishing total choosability of IC-planar graphs
• Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24
• Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
• Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs
• Neighbor sum distinguishing total chromatic number of planar graphs
• scientific article; zbMATH DE number 7478554
• Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles
• Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions
• Neighbor sum distinguishing total colorings of planar graphs

zbMATH Keywords

planar graphtotal coloringcombinatorial nullstellensatzdischargingneighbour sum distinguishing total choosability

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• List edge and list total colourings of multigraphs
• A note on the adjacent vertex distinguishing total chromatic number of graphs
• On adjacent-vertex-distinguishing total coloring of graphs
• Graph theory with applications
• On a \(1,2\) conjecture
• Title not available (Why is that?)
• Linear bound on the irregularity strength and the total vertex irregularity strength of graphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• 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
• Combinatorial Nullstellensatz
• Weighted-1-antimagic graphs of prime power order
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
• Neighbor sum distinguishing total colorings of planar graphs
• Total weight choosability of graphs
• Total weight choosability of graphs
• The number of edge 3-colorings of a planar cubic graph as a permanent
• The adjacent vertex distinguishing total chromatic number

Cited In (30)

• \mbox{\boldmath $\Delta=3$} 的图的邻和可区别全可选性
• Neighbor sum distinguishing total choice number of planar graphs without 6-cycles
• Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10
• Neighbor sum distinguishing total choosability of cubic graphs
• Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions
• Neighbor sum distinguishing index of sparse graphs
• Neighbor sum distinguishing total colorings of planar graphs
• Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz
• Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers
• Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23
• Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10
• Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph
• Title not available (Why is that?)
• Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles
• Neighbor sum distinguishing list total coloring of IC-planar graphs without 5-cycles
• Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles
• Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13
• A note on additive choice number of planar graphs
• Neighbor sum distinguishing total coloring of planar graphs without 4-cycles
• Neighbor sum distinguishing total choosability of planar graphs without intersecting 4-cycles
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
• Total coloring of planar graphs without adjacent chordal 6-cycles
• Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles
• Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs
• Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24
• The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9
• Neighbor sum distinguishing total choosability of IC-planar graphs
• Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10
• Neighbor sum distinguishing total chromatic number of planar graphs

This page was built for publication: Neighbor sum distinguishing total choosability of planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326491)