The following pages link to (Q4704790):
Displaying 40 items.
- On the number of spanning trees in random regular graphs (Q405137) (← links)
- Distribution of coefficients of rank polynomials for random sparse graphs (Q668020) (← links)
- A Tutte polynomial inequality for lattice path matroids (Q679539) (← links)
- Partial graph orientations and the Tutte polynomial (Q679543) (← links)
- An infinite family of 2-connected graphs that have reliability factorisations (Q730493) (← links)
- Covers, orientations and factors (Q785575) (← links)
- On some quadratic algebras. I \(\frac{1}{2}\): Combinatorics of Dunkl and Gaudin elements, Schubert, Grothendieck, Fuss-Catalan, universal Tutte and reduced polynomials (Q903707) (← links)
- A little statistical mechanics for the graph theorist (Q973134) (← links)
- On the algebraic complexity of some families of coloured Tutte polynomials (Q1433009) (← links)
- The Tutte polynomial of an infinite family of outerplanar, small-world and self-similar graphs (Q1673211) (← links)
- Complexity classification of the six-vertex model (Q1706146) (← links)
- Determination of the bases of a splitting matroid (Q1869029) (← links)
- Interpretations of the Tutte and characteristic polynomials of matroids (Q2025137) (← links)
- Interpretations for the Tutte polynomials of morphisms of matroids (Q2081485) (← links)
- Proving identities on weight polynomials of tiered trees via Tutte polynomials (Q2084993) (← links)
- Counting and sampling orientations on chordal graphs (Q2154115) (← links)
- Evaluations of Tutte polynomials of regular graphs (Q2171029) (← links)
- Counting degree-constrained subgraphs and orientations (Q2174586) (← links)
- Combinatorial properties of Farey graphs (Q2333787) (← links)
- Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs (Q2359983) (← links)
- The drop polynomial of a weighted digraph (Q2399350) (← links)
- On the number of planar Eulerian orientations (Q2400972) (← links)
- Fourientation activities and the Tutte polynomial (Q2408966) (← links)
- Fourientations and the Tutte polynomial (Q2408990) (← links)
- Extremal graphs for the Tutte polynomial (Q2664552) (← links)
- Upper bound for the number of spanning forests of regular graphs (Q2700981) (← links)
- Short proof of a theorem of Brylawski on the coefficients of the Tutte polynomial (Q2700984) (← links)
- The Number of Labeled Connected Graphs Modulo Prime Powers (Q2808161) (← links)
- Rank and Bollobás-Riordan polynomials: Coefficient measures and zeros (Q3295936) (← links)
- A Tutte Polynomial for Maps (Q4554775) (← links)
- (Q5002746) (← links)
- (Q5030926) (← links)
- (Q5110947) (← links)
- GEOMETRIC BIJECTIONS FOR REGULAR MATROIDS, ZONOTOPES, AND EHRHART THEORY (Q5204661) (← links)
- A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability (Q5232317) (← links)
- The expansion of a chord diagram and the Tutte polynomial (Q5916013) (← links)
- On maximum graphs in Tutte polynomial posets (Q6064837) (← links)
- COMBINATORIAL PROPERTIES FOR A CLASS OF SIMPLICIAL COMPLEXES EXTENDED FROM PSEUDO-FRACTAL SCALE-FREE WEB (Q6158062) (← links)
- Models of random subtrees of a graph (Q6183888) (← links)
- The Merino-Welsh conjecture is false for matroids (Q6496873) (← links)
