Adjoint factorization of graphs of H^s(i,j)-shape and chromatically equivalence of their complement

MaRDI QIDQ3171153zbMATH OpenFDO

Authors Yin Bao, Bingru Zhang

Publication date 29 September 2011

zbMATH Keywords

factorizationchromatic polynomialadjoint polynomialchromatically equivalence

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• The adjoint factorizations of graphs of \(G^{S^p}_{j_1}\)-shape and chromatically equivalence of their complement graphs
• scientific article; zbMATH DE number 6263312
• The factorization theorem of adjoint polynomials of a kind of graph and chromatically equivalence of its complement
• The factorization of adjoint polynomials of graphs of \(\Phi^S\)-shape and chromatic non-uniqueness analysis
• The factorizations of adjoint polynomials of graphs of shape as \(Y(2,2,\lambda)\) and chromatically equivalence of their complements

Cited in

(6)

• The adjoint factorizations of graphs of \(G^{S^p}_{j_1}\)-shape and chromatically equivalence of their complement graphs
• scientific article; zbMATH DE number 6263312 (Why is no real title available?)
• scientific article; zbMATH DE number 5927223 (Why is no real title available?)
• scientific article; zbMATH DE number 5056122 (Why is no real title available?)
• The factorization of adjoint polynomials of graphs of \(\Phi^S\)-shape and chromatic non-uniqueness analysis
• A formula for counting the number of adjoint equivalence graphs of 2-series integers reset except number 2

This page was built for publication: Adjoint factorization of graphs of \(H^{s(i,j)}\)-shape and chromatically equivalence of their complement

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