Chromatic roots and Hamiltonian paths

DOI10.1006/jctb.2000.1976zbMath1026.05048OpenAlexW2002404102WikidataQ56926754 ScholiaQ56926754MaRDI QIDQ1850497

Carsten Thomassen

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/ac5fa94f5f89c7940da98e0bb68cf073183571b2

zbMATH Keywords

chromatic polynomialcolorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items

Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs, On the roots of domination polynomial of graphs, A zero-free interval for chromatic polynomials of graphs with 3-leaf spanning trees, Chromatic properties of Hamiltonian graphs, Enumeration of substitutional isomers with restrictive mutual positions of ligands: I. Overall counts, On the roots of edge cover polynomials of graphs, Domination numbers and zeros of chromatic polynomials, Zero-free intervals of chromatic polynomials of hypergraphs, A little statistical mechanics for the graph theorist, On separating cycles in graphs, Chromatic Roots and Minor-Closed Families of Graphs, Traversing every edge in each direction once, but not at once: Cubic (polyhedral) graphs

Cites Work

• On the Number of Hamiltonian Cycles in Bipartite Graphs
• A Zero-Free Interval for Chromatic Polynomials of Graphs
• The Zero-Free Intervals for Chromatic Polynomials of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item