On the public citation graph

Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen

https://doi.org/10.1007/bf02995957
0 signed · 45 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01792729openalex-snapshot
Theorie der endlichen und unendlichen Graphen
inferredcites →https://doi.org/10.1007/bf02412090openalex-snapshot
Arc coverings of graphs
inferredcites →https://doi.org/10.1090/s0002-9939-1966-0188103-0openalex-snapshot
On Hamiltonian Circuits in Finite Graphs
inferredcites →https://doi.org/10.1112/plms/s3-2.1.69openalex-snapshot
Some Theorems on Abstract Graphs
inferredcites →https://doi.org/10.2307/2308928openalex-snapshot
Note on Hamilton Circuits
inferredcites →https://doi.org/10.4153/cjm-1966-073-4openalex-snapshot
Trees in Polyhedral 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.20253openalex-snapshot
Ore‐type condition for the existence of connected factors
inferred← citeshttps://doi.org/10.1002/jgt.3190110413openalex-snapshot
Extremal problems involving neighborhood unions
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.1002/jgt.70002openalex-snapshot
Ore‐Type Conditions for Existence of a Jellyfish in a Graph
inferred← citeshttps://doi.org/10.1002/rsa.21118openalex-snapshot
The number of bounded‐degree spanning trees
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_63openalex-snapshot
There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them)
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/978-3-642-46908-4_51openalex-snapshot
A Las-Vergnas Type Theorem for Trees
inferred← citeshttps://doi.org/10.1007/bf01375473openalex-snapshot
Spanning trees with bounded degrees
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-010-0953-6openalex-snapshot
Binding Numbers and Connected Factors
inferred← citeshttps://doi.org/10.1007/s00373-010-0973-2openalex-snapshot
Spanning Trees: A Survey
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-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-1434-0openalex-snapshot
Spanning $$k$$ k -Forests with Large Components in $$K_{1,k+1}$$ K 1 , k + 1 -Free Graphs
inferred← citeshttps://doi.org/10.1007/s00373-021-02283-zopenalex-snapshot
Closure and Spanning Trees with Bounded Total Excess
inferred← citeshttps://doi.org/10.1007/s00373-021-02334-5openalex-snapshot
Rainbow and Properly Colored Spanning Trees in Edge-Colored Bipartite 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/s10255-019-0864-0openalex-snapshot
On a Spanning K-tree Containing Specified Vertices in a Graph
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/s40590-019-00250-6openalex-snapshot
A note on spanning trees with a specified degree sequence
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50002-6openalex-snapshot
10.1016/b978-044488002-4/50002-6
inferred← citeshttps://doi.org/10.1016/j.camwa.2010.02.021openalex-snapshot
An ILP formulation and genetic algorithm for the Maximum Degree-Bounded Connected Subgraph problem
inferred← citeshttps://doi.org/10.1016/j.disc.2004.04.005openalex-snapshot
Spanning spiders and light-splitting switches
inferred← citeshttps://doi.org/10.1016/j.disc.2007.08.036openalex-snapshot
On covering vertices of a graph by trees
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.099openalex-snapshot
Degree conditions and degree bounded trees
inferred← citeshttps://doi.org/10.1016/j.disc.2008.12.028openalex-snapshot
A degree sum condition for graphs to be prism hamiltonian
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.endm.2005.06.048openalex-snapshot
Degree Conditions and Degree Bounded Trees
inferred← citeshttps://doi.org/10.1017/s0963548318000196openalex-snapshot
Triangle-Tilings in Graphs Without Large Independent Sets
inferred← citeshttps://doi.org/10.1137/17m1152759openalex-snapshot
Spanning Trees with Few Branch Vertices
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.37236/3628openalex-snapshot
Spanning $k$-trees of Bipartite Graphs
inferred← citeshttps://doi.org/10.4236/ojdm.2016.62011openalex-snapshot
The Rupture Degree of Graphs with k-Tree
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.7151/dmgt.2234openalex-snapshot
Degree sum condition for the existence of spanning k -trees in star-free 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.