Neighbor sum distinguishing total choosability of graphs with larger maximum average degree.
From MaRDI portal
Publication:2828964
Recommendations
- \mbox{\boldmath $\Delta=3$} 的图的邻和可区别全可选性
- Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
- Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers
- Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\)
- Neighbor sum distinguishing total coloring of a kind of sparse graph.
Cited in
(10)- \mbox{\boldmath $\Delta=3$} 的图的邻和可区别全可选性
- Neighbor sum distinguishing total coloring of planar graphs without 5-cycles
- Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers
- Neighbor sum distinguishing total coloring of a kind of sparse graph.
- Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
- On the total neighbour sum distinguishing index of graphs with bounded maximum average degree
- Neighbor sum distinguishing total choosability of planar graphs without intersecting 4-cycles
- Neighbor product distinguishing total coloring of planar graphs without 5-cycles
- Neighbor sum distinguishing total choosability of IC-planar graphs
- Neighbor Sum Distinguishing Total Chromatic Number of Graphs with Lower Average Degree
This page was built for publication: Neighbor sum distinguishing total choosability of graphs with larger maximum average degree.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828964)
