Pages that link to "Item:Q5826302"
From MaRDI portal
The following pages link to A Contribution to the Theory of Chromatic Polynomials (Q5826302):
Displayed 50 items.
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Nowhere-zero flow polynomials (Q703684) (← links)
- The limit of chromatic polynomials (Q754885) (← links)
- Generalized chromatic polynomials (Q795839) (← links)
- Group connectivity of graphs with diameter at most 2 (Q820087) (← links)
- Eulerian colorings and the bipartizing matchings conjecture of Fleischner (Q852699) (← links)
- A zero-free interval for flow polynomials of cubic graphs (Q858684) (← links)
- The number of nowhere-zero flows on graphs and signed graphs (Q859616) (← links)
- Enumerating degree sequences in digraphs and a cycle--cocycle reversing system (Q875070) (← links)
- Bounds for the coefficients of flow polynomials (Q875944) (← links)
- Edge-rooted forests and the \(\alpha\)-invariant of cone graphs (Q881589) (← links)
- A Tutte polynomial for signed graphs (Q912115) (← links)
- Inapproximability of the Tutte polynomial (Q937302) (← links)
- On chromatic and flow polynomial unique graphs (Q947115) (← links)
- Counting nowhere-zero flows on wheels (Q952677) (← links)
- Degree sum and nowhere-zero 3-flows (Q998360) (← links)
- A Tutte polynomial which distinguishes rooted unicyclic graphs (Q1003609) (← links)
- Every line graph of a 4-edge-connected graph is \(\mathbf Z_3\)-connected (Q1003612) (← links)
- Nowhere-zero integral flows on a bidirected graph (Q1053716) (← links)
- On Tutte polynomials and cycles of plane graphs (Q1077427) (← links)
- (m)-covering of a triangulation (Q1085172) (← links)
- Matroid Steiner problems, the Tutte polynomial and network reliability (Q1088995) (← links)
- Homotopy properties of greedoids (Q1101115) (← links)
- Chromatic polynomials and network reliability (Q1104334) (← links)
- Short circuit covers for regular matroids with a nowhere zero 5-flow (Q1112053) (← links)
- On the fundamental group of 3-gems and a `planar' class of 3-manifolds (Q1120154) (← links)
- Flows and generalized coloring theorems in graphs (Q1133552) (← links)
- On Tutte's extension of the four-colour problem (Q1157338) (← links)
- Nowhere-zero 6-flows (Q1159209) (← links)
- Constructing a covering triangulation by means of a nowhere-zero dual flow (Q1160138) (← links)
- A constructive approach to the critical problem for matroids (Q1160185) (← links)
- Hyperplane reconstruction of the Tutte polynomial of a geometric lattice (Q1163564) (← links)
- On the enumeration of chains in regular chain-groups (Q1164635) (← links)
- On external activity and inversions in trees (Q1172066) (← links)
- Integer flows and cycle covers (Q1186130) (← links)
- A proof of Julian West's conjecture that the number of two-stack-sortable permutations of length \(n\) is \(2(3n)\)!/(\((n+1)\)!\((2n+1)\)!) (Q1193435) (← links)
- The medial graph and voltage-current duality (Q1196985) (← links)
- A new invariant of plane bipartite cubic graphs (Q1197024) (← links)
- A contribution to the theory of Tutte's \(V\)- and \(W\)-function (Q1198513) (← links)
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties (Q1204467) (← links)
- A generalized chromatic polynomial, acyclic orientations with prescribed sources and sinks, and network reliability (Q1210562) (← links)
- Remarkable valuation of the dichromatic polynomial of planar multigraphs (Q1223426) (← links)
- Acyclic and totally cyclic orientations of combinatorial geometries (Q1256481) (← links)
- The algebra of flows in graphs (Q1276390) (← links)
- The Tutte polynomial of a morphism of matroids. I: Set-pointed matroids and matroid perspectives (Q1296154) (← links)
- Antisymmetric flows and strong colourings of oriented graphs (Q1296157) (← links)
- A weighted graph polynomial from chromatic invariants of knots (Q1296158) (← links)
- On the rooted Tutte polynomial (Q1296162) (← links)
- Catalan, Motzkin, and Riordan numbers (Q1300967) (← links)
- Dichromatic sum equations for outerplanar maps (Q1309141) (← links)