Pages that link to "Item:Q326491"
From MaRDI portal
The following pages link to Neighbor sum distinguishing total choosability of planar graphs (Q326491):
Displaying 30 items.
- Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz (Q287913) (← links)
- Neighbor sum distinguishing total colorings of planar graphs (Q498443) (← links)
- Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles (Q501651) (← links)
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8 (Q785813) (← 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)
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 (Q1732773) (← 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)
- Neighbor sum distinguishing total choice number of planar graphs without 6-cycles (Q1995610) (← links)
- A note on additive choice number of planar graphs (Q2172418) (← links)
- Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles (Q2181224) (← links)
- Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs (Q2182186) (← links)
- Neighbor sum distinguishing index of sparse graphs (Q2194737) (← 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 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 chromatic number of planar graphs (Q2333237) (← links)
- Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph (Q2405976) (← links)
- Total coloring of planar graphs without adjacent chordal 6-cycles (Q2410046) (← links)
- Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10 (Q2424800) (← links)
- \mbox{\boldmath $\Delta=3$} 的图的邻和可区别全可选性 (Q3179898) (← links)
- (Q5033142) (← 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)
- Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23 (Q6162044) (← links)
- Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10 (Q6178525) (← links)
- Neighbor sum distinguishing total choosability of planar graphs without intersecting 4-cycles (Q6657249) (← links)
