Cutpoints and the chromatic polynomial

DOI10.1002/jgt.3190080305zbMath0551.05041OpenAlexW2092041285MaRDI QIDQ3344223

Earl Glen jun. Whitehead, Lian-Chang Zhao

Publication date: 1984

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190080305

zbMATH Keywords

chromatic polynomialcutpointchromatic equivalence

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)

Related Items (31)

On the chromatic uniqueness of bipartite graphs ⋮ Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs ⋮ Classes of chromatically equivalent graphs and polygon trees ⋮ The 3-connectivity of a graph and the multiplicity of zero “2” of its chromatic polynomial ⋮ Chromaticity of certain tripartite graphs identified with a path ⋮ Chromatic classes of certain 2-connected \((n,n+2)\)-graphs. II ⋮ Some problems on chromatic polynomials ⋮ On T-chromatic uniqueness of graphs ⋮ A bibliography on chromatic polynomials ⋮ On \(q\)-graphs ⋮ On graphs whose flow polynomials have real roots only ⋮ The chromaticity of wheels with a missing spoke. II ⋮ On the chromatic equivalence class of graphs ⋮ Chromatic classes of 2-connected \((n, n + 4)\)-graphs with exactly three triangles and at least two induced 4-cycles ⋮ Two classes of chromatically unique graphs ⋮ The chromaticity of wheels with a missing spoke ⋮ Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles. ⋮ Patterns in Khovanov link and chromatic graph homology ⋮ On the chromatic uniqueness of certain bipartite graphs ⋮ The chromatic uniqueness of complete bipartite graphs ⋮ An inequality for chromatic polynomials ⋮ Classes of chromatically unique graphs ⋮ On zero-free intervals of flow polynomials ⋮ Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle ⋮ All wheels with two missing consecutive spokes are chromatically unique ⋮ Chromatic polynomials of connected graphs ⋮ On graphs having no flow roots in the interval \((1,2)\) ⋮ The search for chromatically unique graphs ⋮ The chromaticity of certain graphs with five triangles ⋮ On chromatic uniqueness of uniform subdivisions of graphs ⋮ Chromatic classes of 2-connected \((n,n+3)\)-graphs with at least two triangles

Cites Work

• Structure theory for geometric lattices
• The Use of S-Functions in Combinatorial Analysis
• Unnamed Item

This page was built for publication: Cutpoints and the chromatic polynomial