Pages that link to "Item:Q5560915"
From MaRDI portal
The following pages link to An introduction to chromatic polynomials (Q5560915):
Displaying 50 items.
- An introduction to matching polynomials (Q1229232) (← links)
- Le nombre maximal de colorations d'un graphe Hamiltonien (Q1232417) (← links)
- Coefficient relationship between rook and chromatic polynomials (Q1235713) (← links)
- Stirling number identities from chromatic polynomials (Q1248632) (← links)
- Chromatic uniqueness of the generalized \(\Theta\)-graph (Q1250829) (← links)
- Chromaticity of self-complementary graphs (Q1252863) (← links)
- On unimodal sequences of graphical invariants (Q1257030) (← links)
- Chromatically unique graphs (Q1259606) (← links)
- Chromatic coefficients of linear uniform hypergraphs (Q1272479) (← links)
- The computation of chromatic polynomials (Q1297452) (← links)
- Catalan, Motzkin, and Riordan numbers (Q1300967) (← links)
- Chromatic polynomials of homeomorphism classes of graphs (Q1300985) (← links)
- The chromaticity of certain graphs with five triangles (Q1313879) (← links)
- Laplacian matrices of graphs: A survey (Q1319985) (← links)
- Chromatic classes of 2-connected \((n,n+3)\)-graphs with at least two triangles (Q1322232) (← links)
- Classes of chromatically equivalent graphs and polygon trees (Q1336708) (← links)
- \(T\)-chromatic polynomials (Q1343268) (← links)
- Chromaticity of the complements of paths and cycles (Q1356659) (← links)
- On the chromatic equivalence class of a family of graphs (Q1356678) (← links)
- Chromatic uniqueness in a family of 2-connected graphs (Q1356689) (← links)
- Decomposition of the flow polynomial (Q1359375) (← links)
- A new method for proving chromatic uniqueness of graphs (Q1363698) (← links)
- Chromatic classes of certain 2-connected \((n,n+2)\)-graphs homeomorphic to \(K_ 4\) (Q1366772) (← links)
- Chromatic classes of certain 2-connected \((n,n+2)\)-graphs. II (Q1366773) (← links)
- Some problems on chromatic polynomials (Q1366774) (← links)
- On T-chromatic uniqueness of graphs (Q1366776) (← links)
- Chromaticity of a family of \(K_ 4\) homeomorphs (Q1366777) (← links)
- Adjoint polynomials and chromatically unique graphs (Q1366781) (← links)
- Chromatic equivalence classes of certain generalized polygon trees (Q1366783) (← links)
- A bibliography on chromatic polynomials (Q1366790) (← links)
- On \(q\)-graphs (Q1366792) (← links)
- Two chromatic polynomial conjectures (Q1369659) (← links)
- Chromaticity of chordal graphs (Q1376068) (← links)
- On the chromatic equivalence class of graphs (Q1377862) (← links)
- Hilbert polynomials in combinatorics (Q1383811) (← links)
- Divisibility of certain coefficients of the chromatic polynomials. (Q1420611) (← links)
- Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles. (Q1427480) (← links)
- Proof of a chromatic polynomial conjecture (Q1569069) (← links)
- All wheels with two missing consecutive spokes are chromatically unique (Q1584221) (← links)
- Unimodality of independence polynomials of the incidence product of graphs (Q1637157) (← links)
- On graphs whose flow polynomials have real roots only (Q1658775) (← links)
- Hodge theory for combinatorial geometries (Q1663078) (← links)
- Order quasisymmetric functions distinguish rooted trees (Q1686218) (← links)
- On the unimodality of independence polynomials of very well-covered graphs (Q1699567) (← links)
- Bivariate chromatic polynomials in computer algebra (Q1733312) (← links)
- On the differential polynomial of a graph (Q1734931) (← links)
- The chromatic symmetric functions of trivially perfect graphs and cographs (Q1756046) (← links)
- Maximization of the Choquet integral over a convex set and its application to resource allocation problems (Q1761838) (← links)
- On \(\sigma\)-polynomials and a class of chromatically unique graphs (Q1801695) (← links)
- A characterization of chromatically rigid polynomials (Q1814384) (← links)
