scientific article; zbMATH DE number 4195988

MaRDI QIDQ5203048zbMATH OpenFDO

Authors I. G. Dmitriev, Oleg V. Borodin

Publication date 1991

Full work available at URL https://eudml.org/doc/63363

zbMATH Keywords

Chromatic polynomialsedge colouringsk-tree

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 4089576
• scientific article; zbMATH DE number 3841909
• Chromatic equivalence classes of certain cycles with edges
• scientific article; zbMATH DE number 4132187
• The chromaticity of certain cycles with edges

Cited in

(15)

• Chromatically optimal rigid graphs
• Chromaticity of chordal graphs
• Generalized trees and their applications
• Chromatic polynomials and k-trees
• Chromatic polynomials of some nanostars
• Graph description by the chromatic polynomials
• Chromaticity of triangulated graphs
• Chromatic polynomials, polygon trees, and outerplanar graphs
• scientific article; zbMATH DE number 697169 (Why is no real title available?)
• On chordal graphs and their chromatic polynomials
• scientific article; zbMATH DE number 1751597 (Why is no real title available?)
• An introduction to the k-defect polynomials
• On the degree-chromatic polynomial of a tree
• On the degree-chromatic polynomial of a tree
• Combinatorial rigidity for unicritical polynomials

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