AbstractThomassen has recently shown that a triangulation of the orientable surface of genus g has a spanning tree of maximum degree at most 4, provided every noncontractible cycle has length at least 23g + 4. We show that a 4-connected triangulation of the orientable surface of genus g has a spanning tree of maximum degree at most 3, provided that every noncontractible cycle has length at least 23g + 5. This proves a result suggested by Thomassen. Examples demonstrate that some condition on the length of the noncontractible cycles is necessary for a result of this kind
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...
AbstractThomassen has recently shown that a triangulation of the orientable surface of genus g has a...
AbstractEvery triangulation of the orientable surface of genus g with no noncontractible cycle of le...
AbstractEvery triangulation of the orientable surface of genus g with no noncontractible cycle of le...
AbstractIn this paper we show that for eachnthere is a triangulation of an orientable surface which ...
AbstractIn this paper we show that for eachnthere is a triangulation of an orientable surface which ...
This paper considers the conjecture by Grünbaum that every planar 3-connected graph has a spanning ...
We prove that any planar graph on n vertices has less than 5:2852n spanning trees. Under the restric...
We prove that any planar graph on n vertices has less than 5:2852n spanning trees. Under the restric...
AbstractIn this paper, we prove that there exists a function a:N0×R+→N such that for each ε>0, if G ...
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.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...
AbstractThomassen has recently shown that a triangulation of the orientable surface of genus g has a...
AbstractEvery triangulation of the orientable surface of genus g with no noncontractible cycle of le...
AbstractEvery triangulation of the orientable surface of genus g with no noncontractible cycle of le...
AbstractIn this paper we show that for eachnthere is a triangulation of an orientable surface which ...
AbstractIn this paper we show that for eachnthere is a triangulation of an orientable surface which ...
This paper considers the conjecture by Grünbaum that every planar 3-connected graph has a spanning ...
We prove that any planar graph on n vertices has less than 5:2852n spanning trees. Under the restric...
We prove that any planar graph on n vertices has less than 5:2852n spanning trees. Under the restric...
AbstractIn this paper, we prove that there exists a function a:N0×R+→N such that for each ε>0, if G ...
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.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...