scientific article; zbMATH DE number 5629751

MaRDI QIDQ3640169zbMATH OpenFDO

Authors Jingjing Tian, Lifu Yang, Shuxun Wang, Zhongfu Zhang

Publication date 11 November 2009

zbMATH Keywords

chromatic number of adjacent strong edge coloringdouble graphfan

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• On the adjacent strong edge chromatic number of \(S_m\vee F_n\)
• On the equitable adjacent strong edge coloring of double graph of some graphs
• Adjacent strong edge coloring of P_m F_n
• On the Smarandachely-adjacent-vertex edge coloring of some double graphs
• On the adjacent strong edge coloring of F_n P_n P_n
• scientific article; zbMATH DE number 5812180
• On a number of adjacent vertex distinguishing I-total colorings of a double graph
• On a number of adjacent vertex distinguishing VI-total coloring of double graphs
• On the adjacent-vertex strong distinguishing total chromatic number of S₀+F_n and S₁+F_n
• scientific article; zbMATH DE number 1916560

Cited in

(1)

• The chromatic number of adjacent-position distinguishable edge coloring of multi-joined graph S_m P_n P_n

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