Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles

DOI10.1016/j.tcs.2016.11.003zbMath1357.05027OpenAlexW2556610696MaRDI QIDQ501651

Jian-Sheng Cai, Bao Jian Qiu, Ji Hui Wang

Publication date: 9 January 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.11.003

zbMATH Keywords

planar graphchoosabilityneighbor sum distinguishing total coloringcombinatorial Nullstellensatz

Mathematics Subject Classification ID

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

Related Items (10)

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 choosability of planar graphs without adjacent special 5-cycles ⋮ Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions ⋮ Neighbor sum distinguishing index of sparse graphs ⋮ 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 ⋮ Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles ⋮ Neighbor sum distinguishing total chromatic number of planar graphs

Cites Work

• Unnamed Item
• Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
• Adjacent vertex distinguishing total colorings of 2-degenerate graphs
• A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles
• 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
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• Adjacent vertex distinguishing total colorings of outerplanar graphs
• On the total-neighbor-distinguishing index by sums
• 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
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree

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