On the chromaticity of certain subgraphs of a q-tree

DOI10.1002/JGT.3190130510MaRDI QIDQ3475280zbMATH OpenOpenAlexFDO

Authors Thomas Wanner

Publication date 1989

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

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

zbMATH Keywords

chromatic polynomialtriangulated graphsq-tree

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 4089576
• Onq-trees
• Chromaticity of integral subgraph of \(q_{q-2}\)-tree
• On the chromaticity of the 2-degree integral subgraph of q-trees
• On q-graphs

Cited in

(10)

• A bibliography on chromatic polynomials
• On the chromaticity of the 2-degree integral subgraph of q-trees
• On graphs in which any pair of colour classes but one induces a tree
• On the chromatic equivalence class of graphs
• Chromaticity of integral subgraph of \(q_{q-2}\)-tree
• scientific article; zbMATH DE number 4089576 (Why is no real title available?)
• Some problems on chromatic polynomials
• Chromaticity of triangulated graphs
• Chromaticity of chordal graphs
• scientific article; zbMATH DE number 6730060 (Why is no real title available?)

This page was built for publication: On the chromaticity of certain subgraphs of a q-tree

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