The adjoint factorization of ^G_-class graphs and chromatic equivalence of their complements

MaRDI QIDQ5400331zbMATHFDO

Authors Yun Wang, Bingru Zhang

Publication date 28 February 2014

zbMATH Keywords

factorizationchromatic polynomialchromatic equivalenceadjoint polynomials

Mathematics Subject Classification ID

Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Structural characterization of families of graphs (05C75)

Recommendations

• Proof of adjoint factorizations and chromatic equivalence of graphs \(\rho_n^{G(i)}\bigcup G\) etc
• The factorization of adjoint polynomials of \(E^{G (i)}\)-class graphs and chromatically equivalence analysis
• Factorizations of adjoint polynomials of graphs of shape \({P^{S{G_\lambda}}}\) and chromatically equivalence of their complements
• scientific article; zbMATH DE number 6263312
• The factorization of adjoint polynomials of graphs \(Y^{S^*}_{\lambda_k\delta}\cup \beta_k S^*_\delta\) and chromatic equivalence analysis

Cited in

(2)

• Proof of adjoint factorizations and chromatic equivalence of graphs \(\rho_n^{G(i)}\bigcup G\) etc
• scientific article; zbMATH DE number 6263312 (Why is no real title available?)

This page was built for publication: The adjoint factorization of \(\omega^G_\mu\)-class graphs and chromatic equivalence of their complements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5400331)