On the public citation graph
A Determinant Formula for the Number of Ways of Coloring a Map
0 signed · 343 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118032497.ch1openalex-snapshot
Introduction to Graph Coloring
inferred← citeshttps://doi.org/10.1002/9781394214167.ch20openalex-snapshot
New Variation of Exam Scheduling Problem Using Graph Coloring
inferred← citeshttps://doi.org/10.1002/jgt.10115openalex-snapshot
Maximal σ‐polynomials of connected 3‐chromatic graphs
inferred← citeshttps://doi.org/10.1002/jgt.21739openalex-snapshot
An Extremal Property of Turán Graphs, II
inferred← citeshttps://doi.org/10.1002/jgt.22458openalex-snapshot
A survey on the study of real zeros of flow polynomials
inferred← citeshttps://doi.org/10.1002/jgt.22505openalex-snapshot
New expressions for order polynomials and chromatic polynomials
inferred← citeshttps://doi.org/10.1002/jgt.22917openalex-snapshot
DP‐coloring Cartesian products of graphs
inferred← citeshttps://doi.org/10.1002/jgt.22944openalex-snapshot
DP color functions versus chromatic polynomials (II)
inferred← citeshttps://doi.org/10.1002/jgt.23045openalex-snapshot
On the list color function threshold
inferred← citeshttps://doi.org/10.1002/jgt.3190130207openalex-snapshot
On the greatest number of 2 and 3 colorings of a (v, e)‐graph
inferred← citeshttps://doi.org/10.1002/jgt.3190140104openalex-snapshot
New upper bounds for the greatest number of proper colorings of a (V,E)‐graph
inferred← citeshttps://doi.org/10.1002/jgt.3190170109openalex-snapshot
Lower bounds and upper bounds for chromatic polynomials
inferred← citeshttps://doi.org/10.1002/jgt.3190180404openalex-snapshot
Maximum chromatic polynomials of 2‐connected graphs
inferred← citeshttps://doi.org/10.1007/11780342_35openalex-snapshot
From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials
inferred← citeshttps://doi.org/10.1007/11917496_18openalex-snapshot
Computing Graph Polynomials on Graphs of Bounded Clique-Width
inferred← citeshttps://doi.org/10.1007/978-0-8176-4789-6_9openalex-snapshot
Graph Polynomials and Their Applications I: The Tutte Polynomial
inferred← citeshttps://doi.org/10.1007/978-0-8176-4842-8_25openalex-snapshot
On the Foundations of Combinatorial Theory
inferred← citeshttps://doi.org/10.1007/978-1-4684-9199-9_1openalex-snapshot
Origins and basic concepts
inferred← citeshttps://doi.org/10.1007/978-1-4684-9199-9_3openalex-snapshot
Enumeration in geometric lattices
inferred← citeshttps://doi.org/10.1007/978-3-030-81054-2_6openalex-snapshot
Applications and Extensions
inferred← citeshttps://doi.org/10.1007/978-3-031-40044-5_2openalex-snapshot
History of Knot Theory from Gauss to Jones
inferred← citeshttps://doi.org/10.1007/978-3-031-83438-7_23openalex-snapshot
An Algebraic Characterization of Strong Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-86319-6_18openalex-snapshot
Graph Polynomials: Some Questions on the Edge
inferred← citeshttps://doi.org/10.1007/978-3-031-86319-6_30openalex-snapshot
Graph Polynomials and Local Graph Operations
inferred← citeshttps://doi.org/10.1007/978-3-319-20155-9_12openalex-snapshot
Rota’s Conjecture, the Missing Axiom, and Prime Cycles in Toric Varieties
inferred← citeshttps://doi.org/10.1007/978-3-319-25730-3_5openalex-snapshot
Applications and Extensions
inferred← citeshttps://doi.org/10.1007/978-3-319-30945-3_12openalex-snapshot
Matroid Theory for Algebraic Geometers
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_25openalex-snapshot
On Counting Generalized Colorings
inferred← citeshttps://doi.org/10.1007/978-3-642-11110-5_1openalex-snapshot
Un'Introduzione Alla Teoria Delle Funzioni Di Möbius
inferred← citeshttps://doi.org/10.1007/978-3-642-11110-5_2openalex-snapshot
Some Remarks on the Critical Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-11110-5_3openalex-snapshot
The Tutte Polynomial Part I: General Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-12200-2_6openalex-snapshot
Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_45openalex-snapshot
Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width
inferred← citeshttps://doi.org/10.1007/978-3-642-56666-0_15openalex-snapshot
Recurrence Functions and Numerical Characteristics of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-52921-8_18openalex-snapshot
Semantic Equivalence of Graph Polynomials Definable in Second Order Logic
inferred← citeshttps://doi.org/10.1007/978-81-322-1768-8_10openalex-snapshot
Graph Coloring Problem Solution Using Modified Flocking Algorithm
inferred← citeshttps://doi.org/10.1007/978-981-16-1402-6_8openalex-snapshot
New Results on Chromatic Polynomials
inferred← citeshttps://doi.org/10.1007/978-981-95-9630-0_35openalex-snapshot
Probabilistic Analysis of the Chromatic Polynomial
inferred← citeshttps://doi.org/10.1007/978-981-96-4745-3_3openalex-snapshot
Computer-Based Proofs of Four Color Conjecture
inferred← citeshttps://doi.org/10.1007/978-981-96-4745-3_7openalex-snapshot
Recursion Formulae of Chromatic Polynomial and Four-Color Conjecture
inferred← citeshttps://doi.org/10.1007/bf00531932openalex-snapshot
On the foundations of combinatorial theory I. Theory of M�bius Functions
inferred← citeshttps://doi.org/10.1007/bf01196637openalex-snapshot
A Broken-Circuits-Theorem for hypergraphs
inferred← citeshttps://doi.org/10.1007/bf01787578openalex-snapshot
The search for chromatically unique graphs
inferred← citeshttps://doi.org/10.1007/bf02057587openalex-snapshot
Chromatic sum equations for rooted cubic planar maps
inferred← citeshttps://doi.org/10.1007/bf03322072openalex-snapshot
Bounds to the Chromatic Polynomial of a Graph
inferred← citeshttps://doi.org/10.1007/bfb0062527openalex-snapshot
The combinatorics of algebraic graph theory in theoretical physics
inferred← citeshttps://doi.org/10.1007/s00009-018-1130-zopenalex-snapshot
Enumerating Some Stable Partitions Involving Stirling and r-Stirling Numbers of the Second Kind
inferred← citeshttps://doi.org/10.1007/s00010-022-00929-8openalex-snapshot
A note on the four color theorem
inferred← citeshttps://doi.org/10.1007/s000130050336openalex-snapshot
An improvement of the inclusion-exclusion principle
inferred← citeshttps://doi.org/10.1007/s00026-008-0342-5openalex-snapshot
Preface: Old and New Perspectives on the Tutte Polynomial
inferred← citeshttps://doi.org/10.1007/s00026-008-0347-0openalex-snapshot
Planar Triangulations with Real Chromatic Roots Arbitrarily Close to 4
inferred← citeshttps://doi.org/10.1007/s00026-009-0037-6openalex-snapshot
Orientations, Lattice Polytopes, and Group Arrangements I: Chromatic and Tension Polynomials of Graphs
inferred← citeshttps://doi.org/10.1007/s00026-026-00809-xopenalex-snapshot
Counting Subgraphs of Coloring Graphs Using Shadow Graphs
inferred← citeshttps://doi.org/10.1007/s00029-024-00928-4openalex-snapshot
The Newton polytope and Lorentzian property of chromatic symmetric functions
inferred← citeshttps://doi.org/10.1007/s00214-026-03324-7openalex-snapshot
Size-extensivity and connectedness of first-order exchange energy in symmetry-adapted perturbation theory: a graph-based approach
inferred← citeshttps://doi.org/10.1007/s00224-007-9022-9openalex-snapshot
From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials
inferred← citeshttps://doi.org/10.1007/s00283-011-9248-xopenalex-snapshot
An American Goes to Europe: Three Letters from Oswald Veblen to George Birkhoff in 1913/1914
inferred← citeshttps://doi.org/10.1007/s00283-021-10136-zopenalex-snapshot
The Amazing Chromatic Polynomial
inferred← citeshttps://doi.org/10.1007/s00373-014-1421-5openalex-snapshot
Extremal Bicyclic 3-Chromatic Graphs
inferred← citeshttps://doi.org/10.1007/s00373-014-1521-2openalex-snapshot
Complete $$r$$ r -partite Graphs Determined by their Domination Polynomial
inferred← citeshttps://doi.org/10.1007/s00373-019-02084-5openalex-snapshot
List Coloring a Cartesian Product with a Complete Bipartite Factor
inferred← citeshttps://doi.org/10.1007/s00373-022-02484-0openalex-snapshot
The Dichromatic Polynomial of a Digraph
inferred← citeshttps://doi.org/10.1007/s00373-022-02520-zopenalex-snapshot
A Deletion–Contraction Relation for the DP Color Function
inferred← citeshttps://doi.org/10.1007/s00373-023-02633-zopenalex-snapshot
Non-chromatic-Adherence of the DP Color Function via Generalized Theta Graphs
inferred← citeshttps://doi.org/10.1007/s00373-023-02651-xopenalex-snapshot
Upper Bounds on the Chromatic Polynomial of a Connected Graph with Fixed Clique Number
inferred← citeshttps://doi.org/10.1007/s00373-024-02794-5openalex-snapshot
Bounds for DP Color Function and Canonical Labelings
inferred← citeshttps://doi.org/10.1007/s00373-024-02824-2openalex-snapshot
Independence Number and Maximal Chromatic Polynomials of Connected Graphs
inferred← citeshttps://doi.org/10.1007/s00373-025-02938-1openalex-snapshot
Counting Subgraphs of Coloring Graphs
inferred← citeshttps://doi.org/10.1007/s10114-018-7307-3openalex-snapshot
On the Differential Polynomial of a Graph
inferred← citeshttps://doi.org/10.1007/s10801-007-0086-zopenalex-snapshot
Coloring complexes and arrangements
inferred← citeshttps://doi.org/10.1007/s10801-022-01175-6openalex-snapshot
The e-positivity of two classes of cycle-chord graphs
inferred← citeshttps://doi.org/10.1007/s10910-012-0056-0openalex-snapshot
Enumeration of substitutional isomers with restrictive mutual positions of ligands: I. Overall counts
inferred← citeshttps://doi.org/10.1007/s10955-005-4409-yopenalex-snapshot
Spanning Forests and the q-State Potts Model in the Limit q →0
inferred← citeshttps://doi.org/10.1007/s10955-009-9725-1openalex-snapshot
Transfer Matrices and Partition-Function Zeros for Antiferromagnetic Potts Models
inferred← citeshttps://doi.org/10.1007/s10955-011-0292-xopenalex-snapshot
Transfer Matrices and Partition-Function Zeros for Antiferromagnetic Potts Models VI. Square Lattice with Extra-Vertex Boundary Conditions
inferred← citeshttps://doi.org/10.1007/s12190-023-01967-4openalex-snapshot
The chromatic polynomial of grid graph $$P_3 \square P_n$$
inferred← citeshttps://doi.org/10.1007/s13369-011-0096-yopenalex-snapshot
Graphs Attached to Rings Revisited
inferred← citeshttps://doi.org/10.1007/s40314-025-03249-0openalex-snapshot
A remark on the Whitney Broken Circuit Theorem
inferred← citeshttps://doi.org/10.1007/s40840-020-00975-yopenalex-snapshot
Geometry of Limits of Zeros of Polynomial Sequences of Type (1,1)
inferred← citeshttps://doi.org/10.1007/s40993-024-00612-8openalex-snapshot
On the characterization of chordal graphs using Horn hypergeometric series
inferred← citeshttps://doi.org/10.1007/s44425-025-00015-6openalex-snapshot
The Chromatic Polynomial of $$C_3 \square P_n$$
inferred← citeshttps://doi.org/10.1016/0012-365x(84)90034-7openalex-snapshot
Generalized chromatic polynomials
inferred← citeshttps://doi.org/10.1016/0012-365x(87)90166-xopenalex-snapshot
Chromatic polynomials and network reliability
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90070-iopenalex-snapshot
Some corollaries of a theorem of Whitney on the chromatic polynomial
inferred← citeshttps://doi.org/10.1016/0022-4049(95)90925-bopenalex-snapshot
Hopf algebra methods in graph theory
inferred← citeshttps://doi.org/10.1016/0024-3795(95)00248-popenalex-snapshot
Chromatic invariants for finite graphs: Theme and polynomial variations
inferred← citeshttps://doi.org/10.1016/0031-8914(72)90045-6openalex-snapshot
On the random-cluster model
inferred← citeshttps://doi.org/10.1016/0095-8956(71)90046-3openalex-snapshot
Linked-cluster expansion for the graph-vertex coloration problem
inferred← citeshttps://doi.org/10.1016/0095-8956(71)90066-9openalex-snapshot
A new subgraph expansion for obtaining coloring polynomials for graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(79)90008-xopenalex-snapshot
The limit of chromatic polynomials
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50005-1openalex-snapshot
10.1016/b978-044488002-4/50005-1
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50046-4openalex-snapshot
10.1016/b978-044488002-4/50046-4
inferred← citeshttps://doi.org/10.1016/j.aam.2017.04.005openalex-snapshot
On the complexity of generalized chromatic polynomials
inferred← citeshttps://doi.org/10.1016/j.aam.2019.101942openalex-snapshot
Chromatic symmetric functions in noncommuting variables revisited
inferred← citeshttps://doi.org/10.1016/j.aam.2020.102131openalex-snapshot
On the chromatic polynomial and counting DP-colorings of graphs
inferred← citeshttps://doi.org/10.1016/j.aam.2021.102189openalex-snapshot
Extended chromatic symmetric functions and equality of ribbon Schur functions
inferred← citeshttps://doi.org/10.1016/j.aam.2021.102301openalex-snapshot
DP color functions versus chromatic polynomials
inferred← citeshttps://doi.org/10.1016/j.aam.2022.102426openalex-snapshot
Zeros distribution of the reverse strong Turán expressions of polynomials sequences
inferred← citeshttps://doi.org/10.1016/j.aam.2025.102901openalex-snapshot
Counting flows of b-compatible graphs
inferred← citeshttps://doi.org/10.1016/j.apal.2019.04.007openalex-snapshot
A logician's view of graph polynomials
inferred← citeshttps://doi.org/10.1016/j.dam.2007.10.010openalex-snapshot
On chromatic and flow polynomial unique graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2015.09.015openalex-snapshot
Counting the number of non-equivalent vertex colorings of a graph
inferred← citeshttps://doi.org/10.1016/j.dam.2017.03.016openalex-snapshot
Alliance polynomial of regular graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.11.033openalex-snapshot
The zero forcing polynomial of a graph
inferred← citeshttps://doi.org/10.1016/j.dam.2022.08.002openalex-snapshot
Exact algorithms for counting 3-colorings of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2022.10.012openalex-snapshot
The e -positivity and Schur positivity of some spiders and broom trees
inferred← citeshttps://doi.org/10.1016/j.dam.2025.07.004openalex-snapshot
Distribution of the null coefficients of the differential polynomial of the tree graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2026.07.029openalex-snapshot
Exact thresholds for Schur positivity of the lattices m×2 and m×3
inferred← citeshttps://doi.org/10.1016/j.disc.2005.04.027openalex-snapshot
The number of k-colorings of a graph on a fixed surface
inferred← citeshttps://doi.org/10.1016/j.disc.2007.04.069openalex-snapshot
Optimal graphs for chromatic polynomials
inferred← citeshttps://doi.org/10.1016/j.disc.2010.03.011openalex-snapshot
A little statistical mechanics for the graph theorist
inferred← citeshttps://doi.org/10.1016/j.disc.2012.04.027openalex-snapshot
Hypergraph coloring complexes
inferred← citeshttps://doi.org/10.1016/j.disc.2013.12.016openalex-snapshot
A dense set of chromatic roots which is closed under multiplication by positive integers
inferred← citeshttps://doi.org/10.1016/j.disc.2015.11.009openalex-snapshot
Size of edge-critical uniquely 3-colorable planar graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2016.05.009openalex-snapshot
A zero-free interval for chromatic polynomials of graphs with 3-leaf spanning trees
inferred← citeshttps://doi.org/10.1016/j.disc.2018.08.010openalex-snapshot
The maximum number of colorings of graphs of given order and size: A survey
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113093openalex-snapshot
The DP color function of joins and vertex-gluings of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113131openalex-snapshot
Whitney numbers of matroid extensions and co-extensions
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113303openalex-snapshot
Several improved asymptotic normality criteria and their applications to graph polynomials
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113701openalex-snapshot
Comparing list-color functions of uniform hypergraphs with their chromatic polynomials (II)
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114101openalex-snapshot
New perspectives on polynomial invariants
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115169openalex-snapshot
On the DP-chromatic number of Cartesian products of critical graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2014.07.002openalex-snapshot
Combinatorially interpreting generalized Stirling numbers
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.04.006openalex-snapshot
Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2018.03.001openalex-snapshot
Orientations, lattice polytopes, and group arrangements III: Cartesian product arrangements and applications to Tutte type polynomials
inferred← citeshttps://doi.org/10.1016/j.ejc.2022.103538openalex-snapshot
A broken circuit model for chromatic homology theories
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103890openalex-snapshot
An algebraic approach for counting DP-3-colorings of sparse graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2026.104348openalex-snapshot
Polynomials counting group colorings in graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.11.007openalex-snapshot
Combinatorial filter reduction: Special cases, approximation, and fixed-parameter tractability
inferred← citeshttps://doi.org/10.1016/j.jctb.2008.09.005openalex-snapshot
The chromatic polynomial and list colorings
inferred← citeshttps://doi.org/10.1016/j.jctb.2009.03.002openalex-snapshot
Zero-free regions for multivariate Tutte polynomials (alias Potts-model partition functions) of graphs and matroids
inferred← citeshttps://doi.org/10.1016/j.jctb.2013.06.001openalex-snapshot
Is the five-flow conjecture almost false?
inferred← citeshttps://doi.org/10.1016/j.jctb.2015.07.002openalex-snapshot
Maximizing proper colorings on graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2016.08.002openalex-snapshot
When does the list-coloring function of a graph equal its chromatic polynomial
inferred← citeshttps://doi.org/10.1016/j.jctb.2016.08.005openalex-snapshot
The number of colorings of planar graphs with no separating triangles
inferred← citeshttps://doi.org/10.1016/j.jctb.2018.10.005openalex-snapshot
A proof of Tomescu's graph coloring conjecture
inferred← citeshttps://doi.org/10.1016/j.jctb.2020.01.002openalex-snapshot
Maximum number of colourings: 4-chromatic graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2021.01.006openalex-snapshot
Acyclic orientation polynomials and the sink theorem for chromatic symmetric functions
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.02.002openalex-snapshot
An improved lower bound of P(G,L)−P(G,k) for k-assignments L
inferred← citeshttps://doi.org/10.1016/j.jctb.2024.06.005openalex-snapshot
Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem
inferred← citeshttps://doi.org/10.1016/j.jsc.2018.06.006openalex-snapshot
Bivariate chromatic polynomials in computer algebra
inferred← citeshttps://doi.org/10.1016/j.laa.2010.03.001openalex-snapshot
The weighted complexity and the determinant functions of graphs
inferred← citeshttps://doi.org/10.1016/j.physa.2019.123059openalex-snapshot
Asymptotic behavior of acyclic and cyclic orientations of directed lattice graphs
inferred← citeshttps://doi.org/10.1016/j.rineng.2026.112182openalex-snapshot
A study on chromatic polynomials of bunch graphs
inferred← citeshttps://doi.org/10.1016/j.sciaf.2024.e02235openalex-snapshot
Algorithms for computing chromatic polynomials and chromatic index polynomials
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00245-2openalex-snapshot
Chromatic polynomials of partition systems
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00269-5openalex-snapshot
The search for chromatically unique graphs — II
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)90031-5openalex-snapshot
A bibliography on chromatic polynomials
inferred← citeshttps://doi.org/10.1016/s0021-9800(68)80087-0openalex-snapshot
An introduction to chromatic polynomials
inferred← citeshttps://doi.org/10.1016/s0196-8858(03)00077-0openalex-snapshot
Tutte polynomials and related asymptotic limiting functions for recursive families of graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00225-1openalex-snapshot
Graphs determined by polynomial invariants
inferred← citeshttps://doi.org/10.1016/s0375-9601(99)00611-8openalex-snapshot
T=0 partition functions for Potts antiferromagnets on Möbius strips and effects of graph topology
inferred← citeshttps://doi.org/10.1016/s0378-4371(00)00109-6openalex-snapshot
Exact Potts model partition functions on ladder graphs
inferred← citeshttps://doi.org/10.1016/s0378-4371(00)00225-9openalex-snapshot
Exact Potts model partition function on strips of the triangular lattice
inferred← citeshttps://doi.org/10.1016/s0378-4371(01)00142-xopenalex-snapshot
Exact Potts model partition functions on wider arbitrary-length strips of the square lattice
inferred← citeshttps://doi.org/10.1016/s0378-4371(01)00143-1openalex-snapshot
Exact Potts model partition functions on strips of the honeycomb lattice
inferred← citeshttps://doi.org/10.1016/s0378-4371(01)00150-9openalex-snapshot
Structural properties of Potts model partition functions and chromatic polynomials for lattice strips
inferred← citeshttps://doi.org/10.1016/s0378-4371(01)00189-3openalex-snapshot
Zeroes of the Jones polynomial
inferred← citeshttps://doi.org/10.1016/s0378-4371(02)01028-2openalex-snapshot
General structural results for Potts model partition functions on lattice strips
inferred← citeshttps://doi.org/10.1016/s0378-4371(98)00034-xopenalex-snapshot
Chromatic polynomials for families of strip graphs and their asymptotic limits
inferred← citeshttps://doi.org/10.1016/s0378-4371(98)00301-xopenalex-snapshot
Chromatic polynomials for J(∏H)I strip graphs and their asymptotic limits
inferred← citeshttps://doi.org/10.1016/s0378-4371(98)00568-8openalex-snapshot
Ground-state degeneracy of Potts antiferromagnets: homeomorphic classes with noncompact W boundaries
inferred← citeshttps://doi.org/10.1016/s0378-4371(99)00519-1openalex-snapshot
Chromatic polynomials, Potts models and all that
inferred← citeshttps://doi.org/10.1016/s0550-3213(02)00213-4openalex-snapshot
Universality of coupled Potts models
inferred← citeshttps://doi.org/10.1016/s0960-0779(97)00107-0openalex-snapshot
Classical roots of knot theory
inferred← citeshttps://doi.org/10.1017/s0963548303006023openalex-snapshot
Chromatic Roots are Dense in the Whole Complex Plane
inferred← citeshttps://doi.org/10.1017/s0963548305006942openalex-snapshot
Absence of Zeros for the Chromatic Polynomial on Bounded Degree Graphs
inferred← citeshttps://doi.org/10.1017/s0963548308009449openalex-snapshot
Bounds For The Real Zeros of Chromatic Polynomials
inferred← citeshttps://doi.org/10.1017/s0963548309009845openalex-snapshot
The Equivalence of Two Graph Polynomials and a Symmetric Function
inferred← citeshttps://doi.org/10.1017/s0963548318000184openalex-snapshot
Density of Chromatic Roots in Minor-Closed Graph Families
inferred← citeshttps://doi.org/10.1017/s0963548398003447openalex-snapshot
A Tutte Polynomial for Coloured Graphs
inferred← citeshttps://doi.org/10.1023/a:1010376605067openalex-snapshot
Transfer Matrices and Partition-Function Zeros for Antiferromagnetic Potts Models. I. General Theory and Square-Lattice Chromatic Polynomial
inferred← citeshttps://doi.org/10.1063/1.1664668openalex-snapshot
Weak-Graph Method for Obtaining Formal Series Expansions for Lattice Statistical Problems
inferred← citeshttps://doi.org/10.1063/5.0134592openalex-snapshot
Chromatic polynomial of graphs chain
inferred← citeshttps://doi.org/10.1080/00029890.1972.11992979openalex-snapshot
Thirteen Colorful Variations on Guthrie's Four-Color Conjecture
inferred← citeshttps://doi.org/10.1080/00029890.2021.1901460openalex-snapshot
Bijective Proofs of Proper Coloring Theorems
inferred← citeshttps://doi.org/10.1080/00150517.2025.2574312openalex-snapshot
The Flood Polynomial of a Graph
inferred← citeshttps://doi.org/10.1080/00207160.2016.1167196openalex-snapshot
A note on uniquely 3-colourable planar graphs
inferred← citeshttps://doi.org/10.1080/00207160701828090openalex-snapshot
From rankings’ collinearity to counting SDR's via chromatic list expression
inferred← citeshttps://doi.org/10.1080/00207391003675166openalex-snapshot
A brief historical introduction to Euler's formula for polyhedra, topology, graph theory and networks
inferred← citeshttps://doi.org/10.1080/00927870903095574openalex-snapshot
Unit Graphs Associated with Rings
inferred← citeshttps://doi.org/10.1080/09720529.2021.1891697openalex-snapshot
Integral-root polynomials and chromatic uniqueness of graphs
inferred← citeshttps://doi.org/10.1088/0305-4470/19/9/037openalex-snapshot
The Potts model and flows: II. Many-spin correlation function
inferred← citeshttps://doi.org/10.1088/0305-4470/31/48/003openalex-snapshot
Ground-state degeneracy of Potts antiferromagnets: cases with noncompact W boundaries having multiple points at
inferred← citeshttps://doi.org/10.1088/0305-4470/32/46/102openalex-snapshot
T= 0 partition functions for Potts antiferromagnets on square lattice strips with (twisted) periodic boundary conditions
inferred← citeshttps://doi.org/10.1088/1367-2630/11/2/023001openalex-snapshot
Counting complex disordered states by efficient pattern matching: chromatic polynomials and Potts partition functions
inferred← citeshttps://doi.org/10.1088/1751-8113/43/17/175002openalex-snapshot
Chromatic polynomials of random graphs
showing the first 200 of 343 · page through all 343
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.