scientific article; zbMATH DE number 4195988

zbMATH Open0725.05039MaRDI QIDQ5203048FDOQ5203048

Authors: I. G. Dmitriev, Oleg V. Borodin 

Publication date: 1991

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

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

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

zbMATH Keywords

edge colouringsk-treeChromatic polynomials

Mathematics Subject Classification ID

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

Cited In (14)

• Generalized trees and their applications
• Combinatorial rigidity for unicritical polynomials
• Title not available (Why is that?)
• On the degree-chromatic polynomial of a tree
• On the degree-chromatic polynomial of a tree
• Chromatic polynomials and \(k\)-trees
• Graph description by the chromatic polynomials
• Title not available (Why is that?)
• Chromatically optimal rigid graphs
• Chromaticity of triangulated graphs
• Chromatic polynomials, polygon trees, and outerplanar graphs
• On chordal graphs and their chromatic polynomials
• Chromaticity of chordal graphs
• Chromatic polynomials of some nanostars

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)