Results 71 to 80 of about 568,566 (214)
The structure of chromatic polynomials of planar triangulations and implications for chromatic zeros and asymptotic limiting quantities [PDF]
, 2012 We present an analysis of the structure and properties of chromatic polynomials of one-parameter and multi-parameter families of planar triangulation graphs , where is a vector of integer parameters.
R. Shrock, Yan Xu
semanticscholar +1 more source
The computation of chromatic polynomials
Discrete Mathematics, 1999 The computation of the chromatic polynomial of the truncated icosahedron (a cubic planar graph with 60 vertices and 90 edges) is computed by enhancing the algorithm based on the classical delete-contract theorem.
Gary Haggard, Thomas R. Mathies
openaire +2 more sources
The equivalence of two graph polynomials and a symmetric function
, 2009 The U-polynomial, the polychromate and the symmetric function generalization of the Tutte polynomial due to Stanley are known to be equivalent in the sense that the coefficients of any one of them can be obtained as a function of the coefficients of any ...
Noble, SD +5 more
core +1 more source
Expansions of the chromatic polynomial
Discrete Mathematics, 1973 AbstractThe chromatic polynomial (or chromial) of a graph was first defined by Birkhoff in 1912, and gives the number of ways of properly colouring the vertices of the graph with any number of colours. A good survey of the basic facts about these polynomials may be found in the article by Read [3].It has recently been noticed that some classical ...
openaire +2 more sources
An inequality for chromatic polynomials
Discrete Mathematics, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Signed Projective Cubes, a Homomorphism Point of View
Journal of Graph Theory, EarlyView.ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen +2 more
wiley +1 more source
Chromatic polynomials of signed graphs
, 2023 Signed graphs are currently enjoying intense interest from the combinatorial community due to various mathematical breakthroughs that relied on results about signed graphs.
Utomo, Charissa Irene
core
THE COMPLEXITY OF COMPUTING THE SIGN OF THE TUTTE POLYNOMIAL [PDF]
, 2014 (c) 2014 Society for Industrial and Applied ...
Jerrum, M, Goldberg, LA
core +1 more source
Galois groups of chromatic polynomials
, 2022 The chromatic polynomial P(G, λ) gives the number of ways a graph G can be properly coloured in at most λ colours. In this article we give a summary of the Galois groups of all chromatic polynomials of strongly non-clique-separable graphs of order at ...
K Morgan (13134483)
core +1 more source
Coloring Rings in Species [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 We present a generalization of the chromatic polynomial, and chromatic symmetric function, arising in the study of combinatorial species. These invariants are defined for modules over lattice rings in species.
Jacob White
doaj +1 more source