Pages that link to "Item:Q1740118"

The following pages link to Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10 (Q1740118):

Displaying 24 items.

• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8 (Q785813) (← links)
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 (Q1732773) (← 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 choice number of planar graphs without 6-cycles (Q1995610) (← links)
• Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten (Q2042610) (← links)
• Neighbor sum distinguishing total colorings of corona of subcubic graphs (Q2045233) (← 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)
• 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 choosability of cubic graphs (Q2227993) (← links)
• Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles (Q2282476) (← 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)
• On the total neighbour sum distinguishing index of graphs with bounded maximum average degree (Q2292151) (← links)
• Neighbor sum distinguishing total chromatic number of planar graphs (Q2333237) (← links)
• Neighbor sum distinguishing total coloring of 2-degenerate graphs (Q2410029) (← links)
• Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10 (Q2424800) (← links)
• Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions (Q5035848) (← links)
• Neighbor sum distinguishing list total coloring of IC-planar graphs without 5-cycles (Q5071596) (← links)
• Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10 (Q6178525) (← links)
• Neighbor sum distinguishing total coloring of planar graphs with restrained cycles (Q6637047) (← links)
• Neighbor sum distinguishing total choosability of planar graphs without intersecting 4-cycles (Q6657249) (← links)