scientific article; zbMATH DE number 1829787

zbMATH Open1013.05034MaRDI QIDQ4778477FDOQ4778477

Authors: Bingru Zhang 

Publication date: 14 November 2002

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

Recommendations

• The factorization theorem of adjoint polynomials of a kind of graph and chromatically equivalence of its complement
• The factorization theorem of adjoint polynomials of graphs with application
• The factorization of adjoint polynomials of \(E^{G (i)}\)-class graphs and chromatically equivalence analysis
• The factorization of adjoint polynomials of graphs of \(\Phi^S\)-shape and chromatic non-uniqueness analysis
• scientific article; zbMATH DE number 6263312

zbMATH Keywords

chromatically equivalent graphschromatically non-unique graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (5)

• The factorization of adjoint polynomials of \(E^{G (i)}\)-class graphs and chromatically equivalence analysis
• Title not available (Why is that?)
• Integral-root polynomials and chromatic uniqueness of graphs
• The factorizations of adjoint polynomials of \(Y(2,2,\lambda)\)-shaped graphs and their complements' chromatically equivalence
• The factorization theorem of adjoint polynomials of graphs with application

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