Pages that link to "Item:Q2352779"

The following pages link to Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\) (Q2352779):

Displaying 30 items.

• Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic (Q281776) (← links)
• Neighbor sum distinguishing total choosability of planar graphs (Q326491) (← links)
• Neighbor sum distinguishing total colorings of planar graphs (Q498443) (← links)
• On the neighbor sum distinguishing total coloring of planar graphs (Q897872) (← links)
• Neighbor sum distinguishing total chromatic number of 2-degenerate graphs (Q1627882) (← links)
• Neighbor sum distinguishing total coloring of planar graphs without 4-cycles (Q1679510) (← links)
• The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven (Q1698052) (← links)
• Neighbor sum distinguishing total coloring of sparse IC-planar graphs (Q1706133) (← links)
• Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10 (Q1740118) (← links)
• Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers (Q1751539) (← links)
• A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\) (Q1783617) (← links)
• Neighbor sum distinguishing total coloring of triangle free IC-planar graphs (Q1987570) (← links)
• Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles (Q2181224) (← links)
• Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions (Q2181235) (← links)
• Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs (Q2182186) (← links)
• Neighbor sum distinguishing total coloring of IC-planar graphs (Q2185920) (← links)
• Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24 (Q2219970) (← links)
• Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles (Q2282476) (← links)
• Neighbor sum distinguishing total choosability of IC-planar graphs (Q2282486) (← links)
• Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve (Q2292141) (← links)
• Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13 (Q2292143) (← links)
• Neighbor sum distinguishing total chromatic number of planar graphs (Q2333237) (← links)
• Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph (Q2405976) (← links)
• Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz (Q2409525) (← links)
• The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\) (Q2410091) (← links)
• Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable (Q2424665) (← links)
• A note on the neighbor sum distinguishing total coloring of planar graphs (Q2629242) (← links)
• Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs (Q2631097) (← links)
• (Q3568165) (← links)
• Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10 (Q6178525) (← links)