scientific article; zbMATH DE number 7478554

MaRDI QIDQ5033142zbMATHFDO

Authors Yan Liu, Bao Jian Qiu, Jihui Wang

Publication date 22 February 2022

zbMATH Keywords

planar graphcombinatorial Nullstellensatzdischarging methodneighbor sum distinguishing total choosability

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 adjacent special 5-cycles
• Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
• Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles
• Neighbor sum distinguishing total choosability of planar graphs
• Neighbor sum distinguishing total coloring of planar graphs without 5-cycles
• Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles
• Neighbor sum distinguishing total choice number of planar graphs without 6-cycles
• Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24
• Neighbor sum distinguishing total choosability of IC-planar graphs
• Neighbor sum distinguishing total chromatic number of planar graphs without 4-cycles

Cited in

(10)

• Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles
• Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles
• Neighbor sum distinguishing total choosability of planar graphs without intersecting 4-cycles
• Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
• Neighbor sum distinguishing total choice number of planar graphs without 6-cycles
• Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles
• Neighbor sum distinguishing total choosability of planar graphs
• Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs
• Neighbor sum distinguishing total coloring of planar graphs without 5-cycles
• Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24

This page was built for publication:

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