Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers
From MaRDI portal
Publication:1751539
DOI10.1155/2017/5897049zbMath1441.05078OpenAlexW2767768384MaRDI QIDQ1751539
Kittikorn Nakprasit, Patcharapan Jumnongnit
Publication date: 25 May 2018
Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2017/5897049
Cites Work
- Unnamed Item
- Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
- Neighbor sum distinguishing total choosability of planar graphs
- Neighbor sum distinguishing total colorings of planar graphs
- On the neighbor sum distinguishing total coloring of planar graphs
- On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
- On the total-neighbor-distinguishing index by sums
- Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
- Neighbor sum distinguishing total colorings of triangle free planar graphs
- The adjacent vertex distinguishing total coloring of planar graphs
- Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
- Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
- On adjacent-vertex-distinguishing total coloring of graphs
- A note on the neighbor sum distinguishing total coloring of planar graphs
- Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs
This page was built for publication: Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers