The factorization theorem of adjoint polynomials of graphs with application
From MaRDI portal
Recommendations
- 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 ^S-shape and chromatic non-uniqueness analysis
- scientific article; zbMATH DE number 1829787
- The factorization of adjoint polynomials of \(E^{G (i)}\)-class graphs and chromatically equivalence analysis
- The adjoint factorization theorem of a class of graphs of shape \(Y\) and chromatic equivalence of their complements
Cited in
(13)- Certificates of factorisation for chromatic polynomials
- Certificates of factorisation for a class of triangle-free graphs
- The roots of the adjoint polynomials of a class of graphs
- Characterization for the chromaticity of a class of the dense graphs
- The factorization of adjoint polynomials of graphs of ^S-shape and chromatic non-uniqueness analysis
- scientific article; zbMATH DE number 5927223 (Why is no real title available?)
- The factorization theorem of adjoint polynomials of a kind of graph and chromatically equivalence of its complement
- The chromatically equivalence theorem of three kinds of combinatorial graphs
- The factorization of adjoint polynomials of \(E^{G (i)}\)-class graphs and chromatically equivalence analysis
- scientific article; zbMATH DE number 4081615 (Why is no real title available?)
- Non-bipartite chromatic factors
- scientific article; zbMATH DE number 1766900 (Why is no real title available?)
- scientific article; zbMATH DE number 1829787 (Why is no real title available?)
This page was built for publication: The factorization theorem of adjoint polynomials of graphs with application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5298074)
