Pages that link to "Item:Q5560915"
From MaRDI portal
The following pages link to An introduction to chromatic polynomials (Q5560915):
Displaying 50 items.
- Clique cover products and unimodality of independence polynomials (Q277643) (← links)
- Distinctive power of the alliance polynomial for regular graphs (Q283733) (← links)
- Chromatic polynomials of simplicial complexes (Q295259) (← links)
- Graph products of the trivariate total domination polynomial and related polynomials (Q298962) (← links)
- A dense set of chromatic roots which is closed under multiplication by positive integers (Q394542) (← links)
- Note on the subgraph component polynomial (Q406698) (← links)
- Two remarks on the adjoint polynomial (Q412253) (← links)
- Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs (Q461058) (← links)
- Algebraic properties of chromatic roots (Q510333) (← links)
- Alliance polynomial of regular graphs (Q528552) (← links)
- On the absolute sum of chromatic polynomial coefficient of graphs (Q539349) (← links)
- On the unimodality of independence polynomials of some graphs (Q607359) (← links)
- On deterministic finite automata and syntactic monoid size (Q703576) (← links)
- The interlace polynomial of a graph (Q705880) (← links)
- Chromatic polynomials of complements of bipartite graphs (Q742569) (← links)
- Expansions of the chromatic polynomial (Q759159) (← links)
- Chromatic uniqueness of atoms in lattices of complete multipartite graphs (Q764811) (← links)
- Chromatic polynomials of connected graphs (Q790846) (← links)
- The chromaticity of wheels (Q798668) (← links)
- The search for chromatically unique graphs (Q803145) (← links)
- Chromatic properties of Hamiltonian graphs (Q878611) (← links)
- Benjamini-Schramm continuity of root moments of graph polynomials (Q896079) (← links)
- Size of edge-critical uniquely 3-colorable planar graphs (Q906468) (← links)
- Two classes of chromatically unique graphs (Q911611) (← links)
- The chromaticity of wheels with a missing spoke (Q923093) (← links)
- Domination numbers and zeros of chromatic polynomials (Q952654) (← links)
- Weighted graph colorings (Q963274) (← links)
- Weighted-set graph colorings (Q967667) (← links)
- A proof of unimodality on the numbers of connected spanning subgraphs in an \(n\)-vertex graph with at least \(\left\lceil (3-2\sqrt 2) n^2 + n - \frac {7-2\sqrt 2}{2 \sqrt 2}\right\rceil\) edges (Q968184) (← links)
- A little statistical mechanics for the graph theorist (Q973134) (← links)
- The homology of the cyclic coloring complex of simple graphs (Q1024364) (← links)
- Zero-free regions for multivariate tutte polynomials (alias Potts-model partition functions) of graphs and matroids (Q1044207) (← links)
- On trees of polygons (Q1063618) (← links)
- On the chromatic uniqueness of bipartite graphs (Q1076684) (← links)
- Chromatic sum equations for rooted cubic planar maps (Q1102303) (← links)
- Chromatic polynomials and network reliability (Q1104334) (← links)
- An application of the planar separator theorem to counting problems (Q1108031) (← links)
- On \(\sigma\)-polynomials (Q1111560) (← links)
- On chromatic coefficients (Q1144034) (← links)
- Chromatic polynomials for regular graphs and modified wheels (Q1150375) (← links)
- On the enumeration of chains in regular chain-groups (Q1164635) (← links)
- Signed graph coloring (Q1165249) (← links)
- On maximally saturated graphs (Q1169471) (← links)
- On the chromatic uniqueness of certain bipartite graphs (Q1182976) (← links)
- Unimodular equivalence of graphs (Q1194290) (← links)
- The chromatic uniqueness of \(W_{10}\) (Q1196994) (← links)
- On graphs having \(\sigma\)-polynomials of the same degree (Q1208359) (← links)
- On uniquely 3-colorable graphs (Q1210549) (← links)
- Die chromatischen Polynome unterringfreier Graphen (Q1212005) (← links)
- Algorithm for deriving the chromatic polynomial of a graph (Q1215637) (← links)
