Neighbor Sum Distinguishing Total Chromatic Number of Graphs with Lower Average Degree
From MaRDI portal
Recommendations
- Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
- Neighbor sum distinguishing total coloring of a kind of sparse graph.
- Neighbor sum distinguishing total choosability of graphs with larger maximum average degree.
- Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\)
- \mbox{\boldmath $\Delta=3$} 的图的邻和可区别全可选性
Cites work
- Adjacent vertex distinguishing total coloring of graphs with lower average degree
- Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
- Combinatorial Nullstellensatz
- Graph theory with applications
- Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
- Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
- On adjacent-vertex-distinguishing total coloring of graphs
- On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
- On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
- On the total neighbour sum distinguishing index of graphs with bounded maximum average degree
- On the total-neighbor-distinguishing index by sums
- The adjacent vertex distinguishing total coloring of planar graphs
This page was built for publication: Neighbor Sum Distinguishing Total Chromatic Number of Graphs with Lower Average Degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6121343)
