An introduction to chromatic polynomials

From MaRDI portal
Revision as of 03:36, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5560915

DOI10.1016/S0021-9800(68)80087-0zbMath0173.26203MaRDI QIDQ5560915

Ronald C. Read

Publication date: 1967

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




Related Items (only showing first 100 items - show all)

Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphsIntegral-root polynomials and chromatic uniqueness of graphsFarey Series and Maximal Outerplanar GraphsThe \(k\)-fractal of a simplicial complexThe dichromatic polynomial of a digraphMilnor numbers of projective hypersurfaces and the chromatic polynomial of graphsThe 3-connectivity of a graph and the multiplicity of zero “2” of its chromatic polynomialThe average domination polynomial of graphs is unimodal\(\sigma\)-polynomials and graph coloringZeros of rank-generating functions of Cohen-Macaulay complexesChromatic uniqueness of zero-divisor graphsAnother family of chromatically unique graphsA categorification for the signed chromatic polynomialGeneralised chromatic polynomials of graphs from heaps of piecesThe chromaticity of wheels with a missing spoke. IIThe odd-valued chromatic polynomial of a signed graphOn the number of perfect matchings of generalized theta graphs and the edge cover polynomials of friendship graphsOne more remark on the adjoint polynomialChromaticity of series-parallel graphsSeveral extreme coefficients of the Tutte polynomial of graphsUnimodality of independence polynomials of the cycle cover product of graphsAn improved lower bound of \(P(G,L)-P(G,k)\) for \(k\)-assignments \(L\)Lagrangian geometry of matroidsOn enumeration and entropy of ribbon tilingsProving a conjecture on chromatic polynomials by counting the number of acyclic orientationsComparing list-color functions of uniform hypergraphs with their chromatic polynomials. IIOn real-rootedness of independence polynomials of rooted products of graphs\(p\)-adic roots of chromatic polynomialsLog-concavity of characteristic polynomials and the Bergman fan of matroidsCHROMATIC POLYNOMIALS OF n-CENTIPEDE AND TRIANGULAR SNAKE TSn GRAPHSUnnamed ItemChromatic polynomials of 2-edge-coloured graphsThe work of June HuhMAT-free graphic arrangements and a characterization of strongly chordal graphs by edge-labelingEssence of independence: Hodge theory of matroids since June HuhThe amazing chromatic polynomialSeveral improved asymptotic normality criteria and their applications to graph polynomialsLinear bounds on characteristic polynomials of matroidsA homomorphic polynomial for oriented graphsA note on the four color theoremOn the independent domination polynomial of a graphA note on the real part of complex chromatic rootsNecessary condition for a chromatic polynomialq-plane zeros of the Potts partition function on diamond hierarchical graphsAn introduction to the k-defect polynomialsChromatic equivalence classes of complete tripartite graphsOn the location of zeros of the Homfly polynomialOn the set of Hilbert polynomialsNumber of cyclically irreducible words in the alphabet of a free group of finite rankGalois groups of chromatic polynomialsOn the Broken-Circuit Complex of GraphsA maximal zero-free interval for chromatic polynomials of bipartite planar graphsZero-free intervals of chromatic polynomials of hypergraphsLog-concavity of independence polynomials of some kinds of treesEXACT PARTITION FUNCTION FOR THE POTTS MODEL WITH NEXT-NEAREST NEIGHBOR COUPLINGS ON ARBITRARY-LENGTH LADDERSPreservation of log-concavity on summationExpansions of Chromatic Polynomials and Log-ConcavityGraph theoryThe behavior of Tutte polynomials of graphs under five graph operations and its applicationsList coloring a Cartesian product with a complete bipartite factorProblems on chromatic polynomials of hypergraphsOn the Roots of σ-PolynomialsUnimodality of independence polynomials of rooted products of graphsOn the number of forests and connected spanning subgraphsCHROMATIC POLYNOMIALS OF K_{m}+P_{n}, K_{m}+C_{n} AND G\circ HChromatic polynomials of hypergraphsA note on uniquely 3-colourable planar graphsRecursion relations for chromatic coefficients for graphs and hypergraphsNote on Turán's graphA new subgraph expansion for obtaining coloring polynomials for graphsCoefficients of chromatic polynomialsLe nombre maximal de 3-colorations d'un graphe connexe. (The maximal number of 3-colorations of a connected graph)ALTERNATING COLOURINGS OF THE VERTICES OF A REGULAR POLYGONMatroid Theory for Algebraic GeometersDP color functions versus chromatic polynomialsBijective Proofs of Proper Coloring TheoremsChromatic polynomials of oriented graphsChromatic polynomials and logarithmic concavityA note concerning chromatic polynomialsCharacteristic vertices of trees*Chromatic polynomial of intuitionistic fuzzy graphs using \(\left( \alpha, \beta\right)\)-levelsCharacteristic vertices of trees*A note on graph colouringOn a class of polynomials associated with the subgraphs of a graph and its application to chromatic and dichromatic polynomialsUnnamed ItemChromatic polynomials and broken cyclesThe maximum likelihood degree of a very affine varietyOn the chromatic roots of generalized theta graphsNote on chromatic polynomials of the threshold graphsLog-Concavity of Combinations of Sequences and Applications to Genus DistributionsColorings of the Graph K ᵐ 2 + KnOn k-chromatically unique and k-chromatically equivalent hypergraphsOn chromatic polynomials of hypergraphsAlmost unimodal and real-rooted graph polynomialsOn the unimodality of average edge cover polynomialsChromatic polynomials of graphs from Kac-Moody algebrasExtremal bicyclic 3-chromatic graphsThe chromatic polynomial for cycle graphsOn the chromatic uniqueness of bipartite graphsClique cover products and unimodality of independence polynomials







This page was built for publication: An introduction to chromatic polynomials