Pages that link to "Item:Q2409525"
From MaRDI portal
The following pages link to Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz (Q2409525):
Displaying 26 items.
- Neighbor sum distinguishing total choosability of planar graphs without 4-cycles (Q277657) (← links)
- Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic (Q281776) (← links)
- Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz (Q287913) (← links)
- A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles (Q306111) (← links)
- Neighbor sum distinguishing total choosability of planar graphs (Q326491) (← links)
- Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles (Q501651) (← 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)
- 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)
- 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)
- On \((3, r)\)-choosability of some planar graphs (Q2117577) (← 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 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 choosability of IC-planar graphs (Q2282486) (← links)
- Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13 (Q2292143) (← links)
- Neighbor sum distinguishing total colorings of triangle free planar graphs (Q2355461) (← links)
- Neighbor sum distinguishing total coloring of planar graphs without 5-cycles (Q2402272) (← links)
- Neighbor sum distinguishing total coloring of 2-degenerate graphs (Q2410029) (← links)
- Choosability with union separation of planar graphs without cycles of length 4 (Q2656689) (← links)
- Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10 (Q6178525) (← links)
