Chromaticity of chordal graphs

DOI10.1007/BF03353007zbMath0885.05064OpenAlexW1971034014MaRDI QIDQ1376068

Shao-Ji Xu

Publication date: 10 March 1998

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03353007

zbMATH Keywords

chordal graphchromatic polynomialmaximum clique

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On rigid circuit graphs
• On \(\sigma\)-polynomials
• \(\sigma\)-polynomials and graph coloring
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
• On the chromaticity of certain subgraphs of a q-tree
• Chromaticity of two-trees
• Onq-trees
• Chromaticity of triangulated graphs
• An introduction to chromatic polynomials