The chromatically equivalence theorem of three kinds of combinatorial graphs

MaRDI QIDQ3571077zbMATH OpenFDO

Authors Letian Gong, Bingru Zhang

Publication date 8 July 2010

zbMATH Keywords

adjoint polynomialchromatic polynomialchromatical equivalencefactorizations

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph polynomials (05C31)

Recommendations

• The factorization theorem of adjoint polynomials of a kind of graph and chromatically equivalence of its complement
• The adjoint factorization theorem of a class of graphs of shape \(Y\) and chromatic equivalence of their complements
• The adjoint factorizations of graphs of \(G^{S^p}_{j_1}\)-shape and chromatically equivalence of their complement graphs
• The factorization of adjoint polynomials of \(E^{G (i)}\)-class graphs and chromatically equivalence analysis
• The factorization theorem of adjoint polynomials of graphs with application

Cited in

(5)

• Homomorphisms of 3-chromatic graphs
• A formula for counting the number of adjoint equivalence graphs of 2-series integers reset except number 2
• A sufficient and necessary condition for the chromatic equivalence of a class of graphs
• THE UNIQUE EQUIVALENCE CLASS OF CHROMATIC RECTANGLE FREE 3-COLORINGS OF A 10 × 10 CHESSBOARD
• Adjoint equivalent graphs about a certain type of 3-ary trees

This page was built for publication: The chromatically equivalence theorem of three kinds of combinatorial graphs

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