Spanning Trees With Leaf Distance at Least Four

Journal of Graph Theory - United States
doi 10.1002/jgt.20221
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Wiley

Related search

Approximating Maximum Leaf Spanning Trees in Almost Linear Time

Journal of Algorithms
1998English

NSD Total Choosability of Planar Graphs With Girth at Least Four

2016English

Balanced Partition of Minimum Spanning Trees

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Finding the K Smallest Spanning Trees

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1990English

Distance Based Phylogenetic Trees With Bootstrapping

International Journal of Computer Applications
2012English

Approximating Bounded-Degree Spanning Trees and Connected Factors With Leaves

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
2017English

Twists of Elliptic Curves of Rank at Least Four

English

Mst_clustering: Clustering via Euclidean Minimum Spanning Trees

The Journal of Open Source Software
2016English

Trees With Α-Labelings and Decompositions of Complete Graphs Into Non-Symmetric Isomorphic Spanning Trees

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy