scientific article; zbMATH DE number 6532237

zbMATH Open1340.05090MaRDI QIDQ3461693FDOQ3461693

Authors: Yirong Zheng, Meirun Chen, Shaohui Zhai 

Publication date: 15 January 2016

Title of this publication is not available (Why is that?)

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\)

zbMATH Keywords

chromatic numberadjacent vertex-distinguishing \(E\)-total chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fractional chromatic number of adjacent-vertex distinguishing edge coloring

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)