A counterexample is given to a conjecture by Tutte on the minimum number of spanning trees that a 3-connected planar graph with a prescribed number of edges may have
AbstractJackson and Wormald showed that every 3-connected planar graph G contains a Tutte cycle C su...
We prove that any planar graph on n vertices has less than 5:2852n spanning trees. Under the restric...
AbstractTutte's wheels theorem states that the k-spoked wheel graphs, Wk, are the basic building blo...
AbstractA counterexample is given to a conjecture by Tutte on the minimum number of spanning trees t...
AbstractA counterexample is given to a conjecture by Tutte on the minimum number of spanning trees t...
A counterexample is given to a conjecture by Tutte on the minimum number of spanning trees that a 3-...
Theorem 1. (1) A planar graph with n vertices has at most 5.33333333... n spanning trees. (2) A plan...
We prove that any planar graph on n vertices has less than O(5.2852n) spanning trees. Under the rest...
We prove that any planar graph on n vertices has less than O(5.2852^n) spanning trees. Under the res...
We prove that any planar graph on n vertices has less than O(5.2852^n) spanning trees. Under the res...
We prove that any planar graph on n vertices has less than O(5.2852^n) spanning trees. Under the res...
We prove that any planar graph on n vertices has less than O(5.2852^n) spanning trees. Under the res...
We prove that any planar graph on n vertices has less than O(5.2852^n) spanning trees. Under the res...
We prove that any planar graph on n vertices has less than O(5.2852^n) spanning trees. Under the res...
We prove that any planar graph on n vertices has less than 5:2852n spanning trees. Under the restric...
AbstractJackson and Wormald showed that every 3-connected planar graph G contains a Tutte cycle C su...
We prove that any planar graph on n vertices has less than 5:2852n spanning trees. Under the restric...
AbstractTutte's wheels theorem states that the k-spoked wheel graphs, Wk, are the basic building blo...
AbstractA counterexample is given to a conjecture by Tutte on the minimum number of spanning trees t...
AbstractA counterexample is given to a conjecture by Tutte on the minimum number of spanning trees t...
A counterexample is given to a conjecture by Tutte on the minimum number of spanning trees that a 3-...
Theorem 1. (1) A planar graph with n vertices has at most 5.33333333... n spanning trees. (2) A plan...
We prove that any planar graph on n vertices has less than O(5.2852n) spanning trees. Under the rest...
We prove that any planar graph on n vertices has less than O(5.2852^n) spanning trees. Under the res...
We prove that any planar graph on n vertices has less than O(5.2852^n) spanning trees. Under the res...
We prove that any planar graph on n vertices has less than O(5.2852^n) spanning trees. Under the res...
We prove that any planar graph on n vertices has less than O(5.2852^n) spanning trees. Under the res...
We prove that any planar graph on n vertices has less than O(5.2852^n) spanning trees. Under the res...
We prove that any planar graph on n vertices has less than O(5.2852^n) spanning trees. Under the res...
We prove that any planar graph on n vertices has less than 5:2852n spanning trees. Under the restric...
AbstractJackson and Wormald showed that every 3-connected planar graph G contains a Tutte cycle C su...
We prove that any planar graph on n vertices has less than 5:2852n spanning trees. Under the restric...
AbstractTutte's wheels theorem states that the k-spoked wheel graphs, Wk, are the basic building blo...
DOI
Add to ORKG