Neighbor sum distinguishing total choosability of IC-planar graphs

DOI10.7151/dmgt.2145zbMath1430.05023OpenAlexW2884523385WikidataQ129507358 ScholiaQ129507358MaRDI QIDQ2282486

Wen Yao Song, Lian-Ying Miao, Yuan-Yuan Duan

Publication date: 8 January 2020

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2145

zbMATH Keywords

combinatorial nullstellensatzmaximum degreeIC-planar graphneighbor sum distinguishing total choosability

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (7)

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 ⋮ On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\) ⋮ Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions ⋮ Neighbor sum distinguishing total coloring of IC-planar graphs ⋮ Neighbor sum distinguishing total coloring of triangle free IC-planar graphs ⋮ Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13

Cites Work

• Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
• Neighbor sum distinguishing total choosability of planar graphs
• 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 distinguishing total coloring and list neighbor sum distinguishing total coloring
• The number of edge 3-colorings of a planar cubic graph as a permanent
• On edge colorings of \(1\)-planar graphs
• On the total-neighbor-distinguishing index by sums
• Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
• Asymptotically optimal neighbor sum distinguishing total colorings of graphs
• Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
• Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
• Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs
• Coloring plane graphs with independent crossings
• Chromatic number, independence ratio, and crossing number
• Combinatorial Nullstellensatz
• Unnamed Item
• Unnamed Item

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