Extremal graphs for the Tutte polynomial
From MaRDI portal
Publication:2664552
DOI10.1016/j.jctb.2021.09.004zbMath1478.05081OpenAlexW3201809236MaRDI QIDQ2664552
Publication date: 17 November 2021
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2021.09.004
Trees (05C05) Graph polynomials (05C31) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
On maximum graphs in Tutte polynomial posets ⋮ Dr. Charles L. Suffel: Scholar, teacher, mentor, friend ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphs with the fewest matchings
- Applications of the Kelmans transformation: extremality of the threshold graphs
- Partial graph orientations and the Tutte polynomial
- Graphs with the maximum or minimum number of 1-factors
- Undirected simple connected graphs with minimum number of spanning trees
- On a conjecture of V. Nikiforov
- Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
- Acyclic and totally cyclic orientations of combinatorial geometries
- A new technique for the characterization of graphs with a maximum number of spanning trees
- Chromatic polynomials with least coefficients
- Chip firing and the Tutte polynomial
- A certain polynomial of a graph and graphs with an extremal number of trees
- Identities for circuit partition polynomials, with applications to the Tutte polynomial
- New method for counting the number of spanning trees in a two-tree network
- Graph vulnerability parameters, compression, and quasi-threshold graphs
- Exploring the Tutte-Martin connection
- Threshold graphs and related topics
- The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions
- Graph vulnerability parameters, compression, and threshold graphs
- Fourientations and the Tutte polynomial
- Acyclic orientations of graphs
- Graph Polynomials and Their Applications I: The Tutte Polynomial
- On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
- Uniformly-most reliable networks do not always exist
- On graphs with randomly deleted edges
- Least reliable networks and the reliability domination
- A reliability-improving graph transformation with applications to network reliability
- Maximizing the number of spanning trees in a graph with n nodes and m edges
- Decompositions of Rational Convex Polytopes
- Maximizing spanning trees in almost complete graphs
- Chromatic Roots are Dense in the Whole Complex Plane
- Extremal graphs for homomorphisms
- Network transformations and bounding network reliability
- Extremal Graphs for Homomorphisms II
- Chordal 2‐Connected Graphs and Spanning Trees
- A higher invariant for matroids
- On the existence of uniformly optimally reliable networks
This page was built for publication: Extremal graphs for the Tutte polynomial
