Chromaticity of two-trees

DOI10.1002/JGT.3190090209MaRDI QIDQ3691688zbMATH OpenOpenAlexFDO

Authors Earl Glen jun. Whitehead

Publication date 1985

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

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

zbMATH Keywords

chromatic polynomial2-trees

Mathematics Subject Classification ID

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

Recommendations

• On the roots of chromatic polynomials
• scientific article; zbMATH DE number 4089576
• On the chromaticity of the 2-degree integral subgraph of q-trees
• Onq-trees
• scientific article; zbMATH DE number 3841909

Cites work

• The Use of S-Functions in Combinatorial Analysis
• The chromaticity of wheels

Cited in

(14)

• Reconfiguring vertex colourings of 2-trees
• Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs
• Graphs determined by polynomial invariants
• Classes of chromatically equivalent graphs and polygon trees
• A bibliography on chromatic polynomials
• Chromatic polynomials of generalized trees
• On the chromatic uniqueness of the graph \(W(n,n-2)+K_ k\)
• Chromatic equivalence classes of complete tripartite graphs
• On the chromatic equivalence class of graphs
• Tree-chromatic number
• A characterization of chromatically rigid polynomials
• scientific article; zbMATH DE number 4089576 (Why is no real title available?)
• The chromatic equivalence class of \(K_{1, n, n + 2}\)
• Chromaticity of chordal graphs

This page was built for publication: Chromaticity of two-trees

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