The coloring of graphs
From MaRDI portal
Publication:1353247
DOI10.2307/1968214zbMath0005.31301OpenAlexW2332615042WikidataQ33738429 ScholiaQ33738429MaRDI QIDQ1353247
Publication date: 1932
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1968214
Related Items (26)
Integral-root polynomials and chromatic uniqueness of graphs ⋮ Knots and Graphs: Two Centuries of Interaction ⋮ Sign-Coherent Identities for Characteristic Polynomials of Matroids ⋮ Reciprocity and Polynomial Properties for Even Flows and Potentials on Directed Graphs ⋮ Chromatic classes of 2-connected \((n, n + 4)\)-graphs with exactly three triangles and at least two induced 4-cycles ⋮ A note on the four color theorem ⋮ Short certificates for chromatic equivalence ⋮ Potts model and graph theory. ⋮ A Combinatorial Model for Series-Parallel Networks ⋮ Undecidability of linear inequalities in graph homomorphism densities ⋮ The Equivalence of Two Graph Polynomials and a Symmetric Function ⋮ The Chromatic Polynomial of the Truncated Icosahedron ⋮ The contributions of W.T. Tutte to matroid theory ⋮ A NOTE ON THE TUTTE POLYNOMIAL AND THE AUTOMORPHISM GROUP OF A GRAPH ⋮ On the absolute sum of chromatic polynomial coefficient of graphs ⋮ EXACT PARTITION FUNCTION FOR THE POTTS MODEL WITH NEXT-NEAREST NEIGHBOR COUPLINGS ON ARBITRARY-LENGTH LADDERS ⋮ Structural properties of Potts model partition functions and chromatic polynomials for lattice strips ⋮ Exact Potts model partition functions on strips of the honeycomb lattice ⋮ Exact Potts model partition functions on wider arbitrary-length strips of the square lattice ⋮ Expansions of Chromatic Polynomials and Log-Concavity ⋮ A numerical equivalent of the four color map Problem ⋮ A note on uniquely 3-colourable planar graphs ⋮ Exact Potts model partition function on strips of the triangular lattice ⋮ Reflection positivity, rank connectivity, and homomorphism of graphs ⋮ Differential calculus on graphon space ⋮ A numerical equivalent of the four color map problem.
This page was built for publication: The coloring of graphs
