Results 111 to 120 of about 2,394 (219)
Euler characteristics and chromatic polynomials
European Journal of Combinatorics, 2007 This work studies the relation between the chromatic polynomial of a graph \(G\) and the Euler characteristic of certain spaces. These spaces are obtained by a construction which is a generalization of the configuration space. The authors show, in the case that \(G\) has only one point, the following theorem: Let \(G\) be a graph and \(M_G\) the ...
Michael Eastwood, Stephen Huggett
openaire +2 more sources
An extension of the bivariate chromatic polynomial
, 2010 K. Dohmen, A. Pönitz and P. Tittmann [K. Dohmen, A. Pönitz, P. Tittmann, A new two-variable generalization of the chromatic polynomial, Discrete Mathematics and Theoretical Computer Science 6 (2003), 69–90], introduced a bivariate generalization of the ...
Makowsky, J.A. +2 more
core +1 more source
Equitable colorings of ��-corona products of cubic graphs [PDF]
Archives of Control SciencesA graph G is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one.
Hanna Furmańczyk, Marek Kubale
doaj +1 more source
Two Conjectures on the Chromatic Polynomial
, 2000 We propose two conjectures on the chromatic polynomial of a graph and show their validity for several classes of graphs. Our conjectures are stronger than an older conjecture of Bartels and Welsh [1]
NOBILI, Paolo, C. DE SIMONE, D. AVIS
core +1 more source
Chromatic polynomials with least coefficients
Discrete Mathematics, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
José Rodríguez +1 more
openaire +1 more source
A Matrix Method for Chromatic Polynomials
Journal of Combinatorial Theory, Series B, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Chromatic invariants for finite graphs: Theme and polynomial variations
, 1995 The value Px(q) at an integer q ⩾1 of the chromatic polynomial of a finite graph X is the number of morphisms from X to the q-cliqueKq. Generalized chromatic invariants of X are obtained by counting morphisms from X to the qth graph of a given sequence Y∗
de la Harpe, Pierre, Jaeger, François
core +1 more source
The chromatic polynomial of a graph
, 2016 Firstly we express the chromatic polynomials of some graphs in tree form. We then Study a special product that comes natural and is useful in the calculation of some Chromatic polynomials. Next we use the tree form to study the chromatic polynomial Of
Adam, A A
core
All proper colorings of every colorable BSTS(15) [PDF]
Computer Science Journal of Moldova, 2010 A Steiner System, denoted S(t,k,v), is a vertex set X containing v vertices, and a collection of subsets of X of size k, called blocks, such that every t vertices from X are in exactly one of the blocks. A Steiner Triple System, or STS, is a special case
Jeremy Mathews, Brett Tolbert
doaj
On the Adjacency, Laplacian, and Signless Laplacian Spectrum of Coalescence of Complete Graphs
Journal of Mathematics, 2016 Coalescence as one of the operations on a pair of graphs is significant due to its simple form of chromatic polynomial. The adjacency matrix, Laplacian matrix, and signless Laplacian matrix are common matrices usually considered for discussion under ...
S. R. Jog, Raju Kotambari
doaj +1 more source