Results 231 to 240 of about 12,115 (251)

Chromaticity of Chordal Graphs

Graphs and Combinatorics, 1997
A chordal graph is a graph that does not contain any induced cycle with length greater than 3. A polynomial \(P=\lambda^{m_0}(\lambda-1)^{m_1}\cdots (\lambda-k)^{m_k}\) is said to be a chordal polynomial, if for any graph \(G\), \(P(G,\lambda)=P\) implies \(G\) is a chordal graph. The main result of this paper is the following: If \(m_0=1\) and \(\sum_{
openaire   +2 more sources

Home - About - Disclaimer - Privacy