scientific article; zbMATH DE number 6532237
From MaRDI portal
Publication:3461693
Recommendations
- A note on the adjacent vertex distinguishing total chromatic number of graphs
- Adjacent vertex-distinguishing E-total chromatic numbers of some middle graphs
- On an upper bound for adjacent vertex-distinguishing total chromatic numbers of graphs
- On the adjacent vertex distinguishing edge chromatic number of graphs.
- scientific article; zbMATH DE number 2100912
- On the adjacent vertex distinguishing total chromatic number \(C_m\times K_n\)
- scientific article; zbMATH DE number 5732458
- Adjacent-vertex distinguishing total chromatic number on \(W_s\vee K_{m,n}\)
- On the adjacent vertex-distinguishing edge chromatic number of \(W_m\vee W_n\)
- On the adjacent vertex-distinguishing edge chromatic number of \(W_m\vee W_n\)
Cited in
(4)- scientific article; zbMATH DE number 7070753 (Why is no real title available?)
- Fractional chromatic number of adjacent-vertex distinguishing edge coloring
- scientific article; zbMATH DE number 847107 (Why is no real title available?)
- scientific article; zbMATH DE number 2185526 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3461693)