A bibliography on chromatic polynomials

DOI10.1016/S0012-365X(97)90031-5zbMath0879.05034MaRDI QIDQ1366790

Gek Ling Chia

Publication date: 17 September 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

bibliographychromatic polynomials

Mathematics Subject Classification ID

Biographies, obituaries, personalia, bibliographies (01A70) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Counting pure \(k\)-cycles in sequences of Cayley graphs ⋮ Short certificates for chromatic equivalence ⋮ \(T=0\) partition functions for Potts antiferromagnets on Möbius strips and effects of graph topology ⋮ A little statistical mechanics for the graph theorist ⋮ Zero-free regions for multivariate tutte polynomials (alias Potts-model partition functions) of graphs and matroids ⋮ On the chromatic roots of generalized theta graphs

Cites Work

• Chromaticity of a family of \(K_ 4\)-homeomorphs
• Classes of chromatically unique graphs
• The limit of chromatic polynomials
• Expansions of the chromatic polynomial
• Characterization of quadratic and cubic \(\sigma\)-polynomials
• Chromatic polynomials of connected graphs
• Generalized chromatic polynomials
• The chromaticity of wheels
• The search for chromatically unique graphs
• A correlation inequality involving stable set and chromatic polynomials
• Two classes of chromatically unique graphs
• Zeroes of chromatic polynomials: A new approach to Beraha conjecture using quantum groups
• The chromaticity of wheels with a missing spoke
• The chromatic polynomial of an unlabeled graph
• The chromatic polynomial of a graph
• On trees of polygons
• On the chromatic uniqueness of bipartite graphs
• On Tutte polynomials and cycles of plane graphs
• Legal coloring of graphs
• A note on the chromatic uniqueness of \(W_ 10\)
• Chromatic polynomials and network reliability
• On \(\sigma\)-polynomials
• A note on quadratic \(\sigma\)-polynomials
• Chromatic polynomials of generalized trees
• Limits of chromatic zeros of some families of maps
• 1-factors and polynomials
• Chromatic roots - some observations and conjectures
• On chromatic coefficients
• On the Rédei zeta function
• Chromatic polynomials for regular graphs and modified wheels
• A result on co-chromatic graphs
• On the number of Latin rectangles and chromatic polynomial of L(K//(r,s))
• Intersection theory for graphs
• Cycle decompositions of complete graphs
• A generalization of the dichromatic polynomial of a graph
• On maximally saturated graphs
• On matching coefficients
• On the Birkhoff-Lewis equations
• On the chromatic uniqueness of certain bipartite graphs
• On log concave sequences
• The chromatic uniqueness of complete bipartite graphs
• The chromatic uniqueness of certain broken wheels
• Umbral interpolation and the addition/contraction tree for graphs
• The chromatic uniqueness of \(W_{10}\)
• Corrigendum to: The chromatic uniqueness of complete bipartite graphs
• An inequality for chromatic polynomials
• A zero-free interval for chromatic polynomials
• Connections between the matching and chromatic polynomials
• On graphs having \(\sigma\)-polynomials of the same degree
• On uniquely 3-colorable graphs
• Die chromatischen Polynome unterringfreier Graphen
• A method and two algorithms on the theory of partitions
• Remarkable valuation of the dichromatic polynomial of planar multigraphs
• The rotor effect can alter the chromatic polynomial
• On a general class of graph polynomials
• Is the four-color conjecture almost false?
• An introduction to matching polynomials
• Rook theory. III: Rook polynomials and the chromatic structure of graphs
• Coefficient relationship between rook and chromatic polynomials
• A note on \(P(-\lambda;G)\)
• On a pair of functional equations of combinatorial interest
• Stirling number identities from chromatic polynomials
• Chromatic uniqueness of the generalized \(\Theta\)-graph
• Chromaticity of self-complementary graphs
• On unimodal sequences of graphical invariants
• Chromatically unique graphs
• Classes of chromatically unique or equivalent graphs
• The chromaticity of certain graphs with five triangles
• Permutation enumeration symmetric functions, and unimodality
• Remarks on umbral evaluations of chromatic polynomials
• On chromatic uniqueness of uniform subdivisions of graphs
• Chromatic classes of 2-connected \((n,n+3)\)-graphs with at least two triangles
• Ultimate chromatic polynomials
• Parallel concepts in graph theory
• The matrix of chromatic joins
• Classes of chromatically equivalent graphs and polygon trees
• Chromatic and flow polynomials for directed graphs
• \(T\)-chromatic polynomials
• The chromaticity of \(s\)-bridge graphs and related graphs
• A broken-circuits-theorem for hypergraphs
• On the chromatic equivalence class of a family of graphs
• On graphs in which any pair of colour classes but one induces a tree
• Adjoint polynomials and chromatically unique graphs
• Chromatic equivalence classes of certain generalized polygon trees
• On the structure and chromaticity of graphs in which any two colour classes induce a tree
• On the chromatic equivalence class of graphs
• Elementary strong maps and transversal geometries
• All wheels with two missing consecutive spokes are chromatically unique
• On \(\sigma\)-polynomials and a class of chromatically unique graphs
• A symmetric function generalization of the chromatic polynomial of a graph
• A characterization of chromatically rigid polynomials
• A note concerning chromatic polynomials
• Chromatic polynomials and broken cycles
• Approximations for chromatic polynomials
• \(\sigma\)-polynomials and graph coloring
• Biased graphs. III: Chromatic and dichromatic invariants
• Another family of chromatically unique graphs
• On the chromatic uniqueness of the graph \(W(n,n-2)+K_ k\)
• The chromaticity of wheels with a missing spoke. II
• Chromaticity of series-parallel graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chromatic Sums for Rooted Planar Triangulations, V: Special Equations
• Graphs with least number of colorings
• On chromaticity of graphs
• On ?-equivalence and ?-equivalence of graphs
• The Chromatic Polynomial of the Truncated Icosahedron
• On dichromatic polynomials
• Determinants on Semilattices
• A higher invariant for matroids
• Hadamard determinants Möbius functions, and the chromatic number of a graph
• An introduction to chromatic polynomials
• The golden root of a chromatic polynomial
• A note on coefficients of chromatic polynomials
• On chromatic polynomials and the golden ratio
• Eine Färbungstheorie für endliche Graphen.
• A Decomposition for Combinatorial Geometries
• THE GOLDEN RATIO IN THE THEORY OF CHROMATIC POLYNOMIALS.
• Coefficients of u^n‐5 and u^n‐6 in the Q‐Chromial Q_n(u)
• Thirteen Colorful Variations on Guthrie's Four-Color Conjecture
• Extended Chromatic Polynomials
• Chromatic Sums for Rooted Planar Triangulations: The Cases λ = 1 and λ = 2
• A generalized Möbius inversion formula
• Chromatic Sums for Rooted Planar Triangulations II: The Case λ = τ + 1
• Chromatic Sums for Rooted Planar Triangulations, III: The Case λ = 3
• Chromatic Sums for Rooted Planar Triangulations, IV: The Case λ = ∞
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
• Coloring Six-Rings
• On the theory of graphs
• A Contribution to the Theory of Chromatic Polynomials
• Chromatic Polynomials
• A new 5‐arc‐transitive cubic graph
• Combinatorial reciprocity theorems
• 25 pretty graph colouring problems
• On the chromatic uniqueness of the graph \(W(n,n-2,k)\)
• Codichromatic graphs
• Linked-cluster expansion of the graph-vertex coloration problem
• The Tutte polynomial
• On golden identities for constrained chromials
• Regular major maps of at most 19 regions and their Q-chromials
• Graph theory and statistical physics
• Recursive families of graphs
• A new subgraph expansion for obtaining coloring polynomials for graphs
• Coefficients of chromatic polynomials
• Acyclic orientations of graphs
• Chromatic polynomials and logarithmic concavity
• Some corollaries of a theorem of Whitney on the chromatic polynomial
• On the Number of Hamiltonian Cycles in Bipartite Graphs
• Chromatic polynomials of large triangular lattices
• The Chromatic Polynomial of a Complete Bipartite Graph
• Chromatic uniqueness and equivalence ofK4 homeomorphs
• The Enumeration of Locally Restricted Graphs (I)
• Cutpoints and the chromatic polynomial
• On the chromaticity of certain subgraphs of a q-tree
• Coclosure operators and chromatic polynomials.
• Maximal chromatic polynomials of connected planar graphs
• Certain graph invariants do not distinguish all graphs
• The chromaticity of complete bipartite graphs with at most one edge deleted
• Chromaticity of two-trees
• Onq-trees
• Bijective proofs of two broken circuit theorems
• Coloring the Platonic Solids
• On 3-colorings of bipartitep-threshold graphs
• A note on the matching numbers of triangle-free graphs
• Umbral Calculus, Binomial Enumeration and Chromatic Polynomials
• Chromaticity of triangulated graphs
• Polynomial Invariants of Graphs
• On the greatest number of 2 and 3 colorings of a (v, e)-graph
• Chromatic Solutions
• The unimodality conjecture for convex polytopes
• Rotors in Graph Theory
• Counting Rooted Triangulations
• Line Graphs and their Chromatic Polynomials
• Some Colouring Problems and their Complexity
• The number of shortest cycles and the chromatic uniqueness of a graph
• Expansions of Chromatic Polynomials and Log-Concavity
• Chromatic polynomials, polygon trees, and outerplanar graphs
• Tutte Algebras of Graphs and Formal Group Theory
• Limits of zeroes of recursively defined polynomials
• On the Applications of Mobius Inversion in Combinatorial Analysis
• The Chromatic Polynomial of a Complete r-Partite Graph
• On chromatic equivalence of graphs
• Graph reconstruction—a survey
• The Dichromate and Orientations of a Graph
• On Tutte's Dichromate Polynomial
• Chromatic polynomials and whitney's broken circuits
• The Rank Polynomials of Large Random Lattices
• On chromatic uniqueness of two infinite families of graphs
• Classification of chromatically unique graphs having quadratic σ‐polynomials
• New upper bounds for the greatest number of proper colorings of a (V,E)‐graph
• Maximum chromatic polynomials of 2‐connected graphs
• A Zero-Free Interval for Chromatic Polynomials of Graphs
• Location of Zeros of Chromatic and Related Polynomials of Graphs
• Maximum chromatic polynomials of 2‐connected graphs
• A note on the conditional chromatic polynomial
• On the join of graphs and chromatic uniqueness
• The Zero-Free Intervals for Chromatic Polynomials of Graphs
• Lower bounds and upper bounds for chromatic polynomials
• A note on chromatic uniqueness of graphs
• On a class of polynomials associated with the subgraphs of a graph and its application to chromatic and dichromatic polynomials
• Chromatic Solutions, II

This page was built for publication: A bibliography on chromatic polynomials