Chromaticity of triangulated graphs

DOI10.1002/JGT.3190120215MaRDI QIDQ3818331zbMATH OpenOpenAlexFDO

Authors Paul Vaderlind

Publication date 1988

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190120215

zbMATH Keywords

triangulationchromatic polynomial

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• On the chromaticity of certain subgraphs of a q-tree
• scientific article; zbMATH DE number 773170
• Chromatic polynomials of connected graphs
• Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles.
• scientific article; zbMATH DE number 4195988

Cited in

(13)

• Trapezoid graphs and their coloring
• On chordal graphs and their chromatic polynomials
• Chromaticity of the graph \(\theta(a,b,c,d,e)\)
• scientific article; zbMATH DE number 4039932 (Why is no real title available?)
• scientific article; zbMATH DE number 5199085 (Why is no real title available?)
• Chromaticity of chordal graphs
• scientific article; zbMATH DE number 5139463 (Why is no real title available?)
• A bibliography on chromatic polynomials
• Some problems on chromatic polynomials
• Integral-root polynomials and chromatic uniqueness of graphs
• scientific article; zbMATH DE number 1488856 (Why is no real title available?)
• scientific article; zbMATH DE number 1751597 (Why is no real title available?)
• scientific article; zbMATH DE number 3914360 (Why is no real title available?)

This page was built for publication: Chromaticity of triangulated graphs

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