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

zbMATH Open1465.05087MaRDI QIDQ5000997FDOQ5000997

Hossein Teimoori Faal

Publication date: 16 July 2021

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

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)

Cites Work

• Graph theory
• Title not available (Why is that?)
• Handbook of Enumerative Combinatorics
• Title not available (Why is that?)
• A unified approach to the first derivatives of graph polynomials
• Packing and covering triangles in \(K_{4}\)-free planar graphs
• Clique roots of K4-free chordal graphs
• Title not available (Why is that?)

Cited In (1)

• Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width

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)