On the public citation graph
Spanning trees with bounded degrees
0 signed · 54 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf02995957openalex-snapshot
Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
inferredcites →https://doi.org/10.1007/bf03322958openalex-snapshot
On a conjecture of Las Vergnas concerning certain spanning trees in graphs
inferredcites →https://doi.org/10.1016/0012-365x(72)90079-9openalex-snapshot
A note on Hamiltonian circuits
inferredcites →https://doi.org/10.1016/0095-8956(86)90023-7openalex-snapshot
On k-leaf-connected graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.20008openalex-snapshot
Stability number and [a,b]‐factors in graphs
inferred← citeshttps://doi.org/10.1002/jgt.20471openalex-snapshot
The independence number condition for the existence of a spanning f‐tree
inferred← citeshttps://doi.org/10.1002/jgt.3190150103openalex-snapshot
On the largest tree of given maximum degree in a connected graph
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_31openalex-snapshot
Spanning Trees with Bounded Number of Branch Vertices
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_9openalex-snapshot
Bounded degree spanning trees
inferred← citeshttps://doi.org/10.1007/978-3-540-89550-3_21openalex-snapshot
Chvátal–Erdős Theorem: Old Theorem with New Aspects
inferred← citeshttps://doi.org/10.1007/978-3-540-93952-8openalex-snapshot
Graph Factors and Matching Extensions
inferred← citeshttps://doi.org/10.1007/978-3-642-21919-1openalex-snapshot
Factors and Factorizations of Graphs: Proof Techniques in Factor Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-46908-4_51openalex-snapshot
A Las-Vergnas Type Theorem for Trees
inferred← citeshttps://doi.org/10.1007/bf03352993openalex-snapshot
A Note on Matchings and Spanning Trees with Bounded Degrees
inferred← citeshttps://doi.org/10.1007/s00010-024-01112-xopenalex-snapshot
Characterizing spanning trees via the size or the spectral radius of graphs
inferred← citeshttps://doi.org/10.1007/s00373-004-0587-7openalex-snapshot
Connected Factors in Graphs ? a Survey
inferred← citeshttps://doi.org/10.1007/s00373-006-0660-5openalex-snapshot
On a k-Tree Containing Specified Leaves in a Graph
inferred← citeshttps://doi.org/10.1007/s00373-010-0903-3openalex-snapshot
A k-Tree Containing Specified Vertices
inferred← citeshttps://doi.org/10.1007/s00373-010-0941-xopenalex-snapshot
Degree Bounded Spanning Trees
inferred← citeshttps://doi.org/10.1007/s00373-011-1021-6openalex-snapshot
Spanning k-Trees of n-Connected Graphs
inferred← citeshttps://doi.org/10.1007/s00373-012-1168-9openalex-snapshot
Sufficient Condition for the Existence of an Even [a, b]-Factor in Graph
inferred← citeshttps://doi.org/10.1007/s00373-012-1277-5openalex-snapshot
Spanning Trees with a Bounded Number of Branch Vertices in a Claw-Free Graph
inferred← citeshttps://doi.org/10.1007/s00373-013-1314-zopenalex-snapshot
Closure and Spanning k-Trees
inferred← citeshttps://doi.org/10.1007/s00373-014-1416-2openalex-snapshot
An Extension of the Chvátal–Erdős Theorem: Counting the Number of Maximum Independent Sets
inferred← citeshttps://doi.org/10.1007/s00373-017-1821-4openalex-snapshot
Independence Number and k-Trees of Graphs
inferred← citeshttps://doi.org/10.1007/s00373-025-02945-2openalex-snapshot
Spanning Trees with Few Branch Vertices in a Chair-Free Graph
inferred← citeshttps://doi.org/10.1007/s00493-009-2349-xopenalex-snapshot
A note on a spanning 3-tree
inferred← citeshttps://doi.org/10.1007/s10801-025-01396-5openalex-snapshot
Sufficient conditions for k-factor-critical graphs and spanning k-trees of graphs
inferred← citeshttps://doi.org/10.1007/s11227-024-06355-8openalex-snapshot
Spanning k-trees and distance spectral radius in graphs
inferred← citeshttps://doi.org/10.1007/s11401-019-0141-9openalex-snapshot
An Extension of the Win Theorem: Counting the Number of Maximum Independent Sets
inferred← citeshttps://doi.org/10.1016/j.amc.2019.03.062openalex-snapshot
Number of vertices of degree three in spanning 3-trees in square graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.09.004openalex-snapshot
A note on the independence number, connectivity and k -ended tree
inferred← citeshttps://doi.org/10.1016/j.dam.2024.07.010openalex-snapshot
Spanning k -trees and distance signless Laplacian spectral radius of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.04.015openalex-snapshot
Sufficient conditions for k -factors and spanning trees of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.05.016openalex-snapshot
Tight conditions for spanning trees with leaf degree at most k in graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.04.071openalex-snapshot
Neighborhood unions and extremal spanning trees
inferred← citeshttps://doi.org/10.1016/j.disc.2013.09.002openalex-snapshot
Spanning k -ended trees of bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2015.10.013openalex-snapshot
m -dominating k -trees of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2015.12.023openalex-snapshot
Spanning trees with bounded degrees and leaves
inferred← citeshttps://doi.org/10.1016/j.disc.2019.06.037openalex-snapshot
On spanning trees with few branch vertices
inferred← citeshttps://doi.org/10.1016/j.disc.2024.113927openalex-snapshot
D -index and Q -index for spanning trees with leaf degree at most k in graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115059openalex-snapshot
Eigenvalues and spanning tree in regular graphs
inferred← citeshttps://doi.org/10.1080/03081087.2021.1985055openalex-snapshot
The spanning k-trees, perfect matchings and spectral radius of graphs
inferred← citeshttps://doi.org/10.1142/s1793830919500435openalex-snapshot
Spanning k-tree with specified vertices
inferred← citeshttps://doi.org/10.24275/uami.n009w2365openalex-snapshot
Una condición para árboles generadores de grado acotado
inferred← citeshttps://doi.org/10.3233/jcm-160598openalex-snapshot
Spanning trees with minimum number of leaves in the square graph of a tree
inferred← citeshttps://doi.org/10.3390/axioms12050411openalex-snapshot
Spanning k-Ended Tree in 2-Connected Graph
inferred← citeshttps://doi.org/10.48550/arxiv.1810.11242openalex-snapshot
A note on independence number, connectivity and $k$-ended tree
inferred← citeshttps://doi.org/10.5821/dissertation-2117-94340openalex-snapshot
Descomposicions de grafs en arbres.
inferred← citeshttps://doi.org/10.7151/dmgt.1778openalex-snapshot
On spanning k-tree in which specified vertices have degree less than k
inferred← citeshttps://doi.org/10.7939/r3s04hopenalex-snapshot
Minimum Degree Spanning Trees on Bipartite Permutation Graphs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.