Search results
From MaRDI portal
- Paper The Asymptotic Number of Spanning Trees in Circulant Graphs (Extended Abstract) 2019-09-16 Paper The Spanning Trees Formulas in a Class of Double...10 bytes (17 words) - 19:50, 11 December 2023
- label spanning tree problem 2000-06-20 Paper https://portal.mardi4nfdi.de/entity/Q4944966 2000-06-07 Paper Improving Minimum Cost Spanning Trees by Upgrading...10 bytes (18 words) - 17:15, 7 December 2023
- flow trees 2023-01-18 Paper A network-flow technique for finding low-weight bounded-degree spanning trees 2019-01-11 Paper Low degree spanning trees of small...10 bytes (16 words) - 08:15, 13 December 2023
- the number of spanning trees in regular graphs 2006-12-07 Paper Heuristic approaches to the maximization of the number of spanning trees in regular graphs...10 bytes (18 words) - 02:39, 11 December 2023
- comment on ``Independent spanning trees in crossed cubes 2014-08-28 Paper Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes...10 bytes (18 words) - 17:43, 6 October 2023
- Claw-Free Graphs to Have Spanning Trees with at Most Five Branch Vertices and Leaves in Total 2022-05-09 Paper Spanning trees with few peripheral branch...10 bytes (18 words) - 22:34, 24 September 2023
- algorithm to construct edge-independent spanning trees in augmented cubes 2020-03-23 Paper Edge-independent spanning trees in augmented cubes 2017-03-16 Paper...10 bytes (17 words) - 03:52, 25 September 2023
- for counting the number of spanning trees in circulant and related graphs 2010-04-27 Paper Counting the number of spanning trees in a class of double fixed-step...10 bytes (16 words) - 11:29, 6 October 2023
- independent spanning trees in crossed cubes 2017-01-23 Paper Independent spanning trees in crossed cubes 2014-04-16 Paper Dimension-adjacent trees and parallel...10 bytes (16 words) - 03:18, 25 September 2023
- multiple independent spanning trees on bubble-sort networks 2019-10-29 Paper Constructing three completely independent spanning trees in locally twisted...10 bytes (18 words) - 17:43, 6 October 2023
- constructing multiple independent spanning trees on bubble-sort networks 2019-10-29 Paper Constructing independent spanning trees on bubble-sort networks 2018-10-04...10 bytes (18 words) - 19:03, 24 September 2023
- multiple independent spanning trees on bubble-sort networks 2019-10-29 Paper Constructing three completely independent spanning trees in locally twisted...10 bytes (18 words) - 02:47, 25 September 2023
- Paper Improved bounds for spanning trees with many leaves 2012-04-13 Paper A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic...10 bytes (16 words) - 08:58, 6 October 2023
- construction of vertex-disjoint spanning trees with optimal heights in star networks 2018-02-26 Paper Independent Spanning Trees on Multidimensional Torus Networks...10 bytes (18 words) - 20:30, 21 September 2023
- Type Degree bounded bottleneck spanning trees in three dimensions 2020-02-03 Paper DEGREE BOUNDED GEOMETRIC SPANNING TREES WITH A BOTTLENECK OBJECTIVE FUNCTION...10 bytes (18 words) - 02:38, 7 October 2023
- The Enumeration of Spanning Trees in Dual, Bipartite and Reduced Graphs 2022-04-19 Paper The structural properties and the spanning trees entropy of the generalized...10 bytes (16 words) - 19:05, 24 September 2023
- multiple independent spanning trees on bubble-sort networks 2019-10-29 Paper Constructing three completely independent spanning trees in locally twisted...10 bytes (18 words) - 17:43, 6 October 2023
- on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs 2017-12-20 Paper Packing spanning trees and spanning 2-connected \(k\)-edge-connected...10 bytes (16 words) - 06:35, 7 October 2023
- Independent spanning trees in crossed cubes 2014-04-16 Paper Dimension-adjacent trees and parallel construction of independent spanning trees on crossed...10 bytes (16 words) - 19:20, 6 October 2023
- graph 2023-05-31 Paper Enumeration of spanning trees of middle digraphs 2023-05-03 Paper Counting spanning trees in almost complete multipartite graphs...10 bytes (16 words) - 03:33, 7 October 2023
