Pages that link to "Item:Q1679510"
From MaRDI portal
The following pages link to Neighbor sum distinguishing total coloring of planar graphs without 4-cycles (Q1679510):
Displaying 17 items.
- Neighbor sum distinguishing total choosability of planar graphs without 4-cycles (Q277657) (← links)
- On the neighbor sum distinguishing total coloring of planar graphs (Q897872) (← 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 coloring of IC-planar graphs with short cycle restrictions (Q2181235) (← links)
- Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles (Q2282476) (← links)
- Neighbor sum distinguishing total chromatic number of planar graphs (Q2333237) (← links)
- Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\) (Q2352779) (← links)
- Neighbor sum distinguishing total coloring of planar graphs without 5-cycles (Q2402272) (← links)
- Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph (Q2405976) (← links)
- Neighbor sum distinguishing total coloring of 2-degenerate graphs (Q2410029) (← links)
- A note on the neighbor sum distinguishing total coloring of planar graphs (Q2629242) (← links)
- Neighbor sums distinguishing total colorings of planar graphs without short cycles (Q2811835) (← links)
- Neighbor sum distinguishing list total coloring of IC-planar graphs without 5-cycles (Q5071596) (← links)
- Neighbor sum distinguishing total coloring of planar graphs with restrained cycles (Q6637047) (← links)
- Neighbor product distinguishing total coloring of planar graphs without 5-cycles (Q6661065) (← links)
