Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles

DOI10.1016/J.TCS.2016.11.003MaRDI QIDQ501651zbMATH OpenOpenAlexFDO

Authors Jiansheng Cai, Jihui Wang, Bao Jian Qiu

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

choosabilitycombinatorial Nullstellensatzneighbor sum distinguishing total coloringplanar graph

Mathematics Subject Classification ID

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

Recommendations

• Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
• Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles
• Neighbor sum distinguishing total choosability of planar graphs
• scientific article; zbMATH DE number 7478554
• Neighbor sum distinguishing total colorings of triangle free planar graphs

Cites work

• A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
• Adjacent vertex distinguishing total colorings of 2-degenerate graphs
• Adjacent vertex distinguishing total colorings of outerplanar graphs
• Combinatorial Nullstellensatz
• Graph theory
• Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
• Neighbor sum distinguishing total choosability of planar graphs
• Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
• Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
• Neighbor sum distinguishing total colorings of planar graphs
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
• On adjacent-vertex-distinguishing total coloring of graphs
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• On the neighbor sum distinguishing total coloring of planar graphs
• On the total-neighbor-distinguishing index by sums
• The adjacent vertex distinguishing total coloring of planar graphs

Cited in

(18)

• 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 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 choosability of IC-planar graphs
• Neighbor sum distinguishing total chromatic number of planar graphs
• Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
• \mbox{\boldmath $\Delta=3$} 的图的邻和可区别全可选性
• Neighbor sum distinguishing total choosability of planar graphs
• scientific article; zbMATH DE number 7478554 (Why is no real title available?)
• 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 with maximum degree at least 10
• Neighbor sum distinguishing total choosability of planar graphs without intersecting 4-cycles
• Neighbor product distinguishing total coloring of planar graphs without 5-cycles
• Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 15

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

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