The 224 non-chordal graphs on less than 10 vertices whose chromatic polynomials have no complex roots
type: Item
instance of: scholarly article
title: The 224 non-chordal graphs on less than 10 vertices whose chromatic polynomials have no complex roots
zbMATH Open document ID: 0961.05021
DOI: 10.1016/S0012-365X(00)00170-9
author: Ottavio M. D'Antona
author: Carlo Mereghetti
author: Fabio Zamparini
published in: Discrete Mathematics
publication date: 2001-05-13T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1565957
zbMATH Keywords: chromatic polynomial
zbMATH Keywords: non-chordal graphs
zbMATH Keywords: pyramidal operations
MaRDI profile type: Publication
Recommended article: Non-chordal graphs having integral-root chromatic polynomials. II
Recommended article: Q4379744
Recommended article: Integer roots chromatic polynomials of non-chordal graphs and the Prouhet-Tarry-Escott prob\-lem
Recommended article: Graphs and the multiplicity of root 2 in chromatic polynomials
Recommended article: On chordal graphs and their chromatic polynomials
Recommended article: The chromatic equivalence classes of the complements of graphs with the minimum real roots of their adjoint polynomials greater than \(-4\)
Recommended article: On chromatic polynomials of some kinds of graphs
Recommended article: The largest non-integer real zero of chromatic polynomials of graphs with fixed order
Recommended article: Chromatically equivalent class of certain graphs with integral-root polynomials
Recommended article: On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs
description: scientific article; zbMATH DE number 1565957