scientific article; zbMATH DE number 4132187

MaRDI QIDQ3033784zbMATHFDO

Authors Mieczysław Borowiecki, H. P. Patil

Publication date 1986

zbMATH Keywords

chromatic polynomialk-tree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 3841909
• Colourings of (k-r,k)-trees
• scientific article; zbMATH DE number 4089576
• scientific article; zbMATH DE number 4103086
• On a characterization of \(k\)-trees.

Cited in

(10)

• On an extremal problem for colored trees
• Coloring \(k\)-trees with forbidden monochrome or rainbow triangles
• On purely tree-colorable planar graphs
• A bibliography on chromatic polynomials
• scientific article; zbMATH DE number 437482 (Why is no real title available?)
• scientific article; zbMATH DE number 4041942 (Why is no real title available?)
• A characterization of 2-tree proper interval 3-graphs
• scientific article; zbMATH DE number 6730060 (Why is no real title available?)
• Colourings of (k-r,k)-trees
• Partial \(k\)-trees with maximum chromatic number

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