Clique polynomials of 2-connected K₅-free chordal graphs

MaRDI QIDQ5000997zbMATH OpenFDO

Authors Hossein Teimoori Faal

Publication date 16 July 2021

zbMATH Keywords

chordal graphsclique polynomialsclique rootsclique value

Mathematics Subject Classification ID

Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15)

Recommendations

• Clique roots of \(K_4\)-free chordal graphs
• scientific article; zbMATH DE number 1229629
• Clique vectors of \(k\)-connected chordal graphs
• Clique polynomials and independent set polynomials of graphs
• scientific article; zbMATH DE number 1123931

Cites work

• scientific article; zbMATH DE number 1229629 (Why is no real title available?)
• scientific article; zbMATH DE number 3443655 (Why is no real title available?)
• scientific article; zbMATH DE number 3050594 (Why is no real title available?)
• A unified approach to the first derivatives of graph polynomials
• Clique roots of \(K_4\)-free chordal graphs
• Graph theory
• Handbook of Enumerative Combinatorics
• Packing and covering triangles in \(K_{4}\)-free planar graphs

Cited in

(3)

• Clique roots of \(K_4\)-free chordal graphs
• Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
• Clique vectors of \(k\)-connected chordal graphs

This page was built for publication: Clique polynomials of \(2\)-connected \(K_5\)-free chordal graphs

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