scientific article; zbMATH DE number 892216

zbMATH Open0845.05042MaRDI QIDQ4880947FDOQ4880947

Authors: Botang Han 

Publication date: 23 June 1996

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

Recommendations

• Graphs with the chromatic polynomial \(\sum \frac {n+2}{k} \binom {k}{n+2-k} (\lambda)_{k+1}\)
• Graphs with chromatic polynomial \(\sum_{l\leqslant m_0}\binom l{m_0-l} (\lambda)_l\)
• scientific article; zbMATH DE number 4089574
• On chromatic equivalence of graphs
• scientific article; zbMATH DE number 2058197
• A sufficient and necessary condition for the chromatic equivalence of a class of graphs
• On the chromatic equivalence class of graphs
• The chromatic equivalence class of \(K_{1, n, n + 2}\)
• scientific article; zbMATH DE number 812060
• scientific article; zbMATH DE number 4087686

zbMATH Keywords

treeschromatic polynomialcoloring

Mathematics Subject Classification ID

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

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