The general neighbor-distinguishing total coloring of graphs
From MaRDI portal
Publication:3073345
Recommendations
- A note on general neighbor-distinguishing total coloring of graphs.
- On adjacent-vertex-distinguishing total coloring of graphs
- The general neighbor-distinguishing chromatic index of graphs
- On the adjacent spectral radius of cycles with fixed weight sets
- General vertex-distinguishing total coloring of graphs
Cited in
(12)- scientific article; zbMATH DE number 5722817 (Why is no real title available?)
- The general neighbor-distinguishing edge coloring of strong products and compositions of graphs
- General neighbour-distinguishing indices on some classes of operation graphs
- scientific article; zbMATH DE number 6500527 (Why is no real title available?)
- scientific article; zbMATH DE number 7746013 (Why is no real title available?)
- Neighbor-distinguishing vertex colorings of graphs
- A note on general neighbor-distinguishing total coloring of graphs.
- On the adjacent spectral radius of cycles with fixed weight sets
- The general neighbor-distinguishing chromatic index of graphs
- Open neighbourhood colouring of some path related graphs
- scientific article; zbMATH DE number 7144820 (Why is no real title available?)
- The neighbor expanded sum distinguishing total colorings of three types of join graphs of wheel and fan
This page was built for publication: The general neighbor-distinguishing total coloring of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073345)