On the public citation graph

On a connection between the existence ofk-trees and the toughness of a graph

https://doi.org/10.1007/bf01788671
0 signed · 83 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.1002/jgt.3190080116openalex-snapshot
Hamiltonian results in K1,3‐free graphs
inferredcites →https://doi.org/10.1016/0012-365x(73)90138-6openalex-snapshot
Tough graphs and hamiltonian circuits

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(200003)33:3<125::aid-jgt1>3.0.co;2-xopenalex-snapshot
Toughness, trees, and walks
inferred← citeshttps://doi.org/10.1002/jgt.10019openalex-snapshot
Connected (g, f)‐factors
inferred← citeshttps://doi.org/10.1002/jgt.20221openalex-snapshot
Spanning trees with leaf distance at least four
inferred← citeshttps://doi.org/10.1002/jgt.20244openalex-snapshot
Tough spiders
inferred← citeshttps://doi.org/10.1002/jgt.20250openalex-snapshot
Hamilton cycles in prisms
inferred← citeshttps://doi.org/10.1002/jgt.21824openalex-snapshot
Spanning Trees with Vertices Having Large Degrees
inferred← citeshttps://doi.org/10.1002/jgt.22206openalex-snapshot
Complete graph immersions and minimum degree
inferred← citeshttps://doi.org/10.1002/jgt.22620openalex-snapshot
Toughness and spanning trees in K4‐minor‐free graphs
inferred← citeshttps://doi.org/10.1002/jgt.v56:4openalex-snapshot
inferred← citeshttps://doi.org/10.1002/net.20031openalex-snapshot
Approximation algorithms for finding low‐degree subgraphs
inferred← citeshttps://doi.org/10.1007/3-540-45294-x_20openalex-snapshot
The Directed Minimum-Degree Spanning Tree Problem
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_9openalex-snapshot
Bounded degree spanning trees
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_104openalex-snapshot
Degree-Bounded Trees
inferred← citeshttps://doi.org/10.1007/978-1-4613-3554-2_16openalex-snapshot
The NSM of a Graph
inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_25openalex-snapshot
Drawing Graphs as Spanners
inferred← citeshttps://doi.org/10.1007/978-3-030-90048-9_7openalex-snapshot
Hamiltonicity of Graphs on Surfaces in Terms of Toughness and Scattering Number – A Survey
inferred← citeshttps://doi.org/10.1007/978-3-031-59835-7_31openalex-snapshot
Fast Combinatorial Algorithms for Efficient Sortation
inferred← citeshttps://doi.org/10.1007/978-3-319-03536-9_4openalex-snapshot
On the Power of Adversarial Infections in Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_4openalex-snapshot
Compact Forbidden-Set Routing
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-540-93980-1_3openalex-snapshot
Degree-Constrained Subgraph Problems: Hardness and Approximation Results
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/bf01195323openalex-snapshot
Long paths and cycles in tough graphs
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-0649-0openalex-snapshot
Toughness in Graphs – A Survey
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-0973-2openalex-snapshot
Spanning Trees: A Survey
inferred← citeshttps://doi.org/10.1007/s00373-014-1487-0openalex-snapshot
A Toughness Condition for a Spanning Tree With Bounded Total Excesses
inferred← citeshttps://doi.org/10.1007/s00454-022-00398-5openalex-snapshot
Drawing Graphs as Spanners
inferred← citeshttps://doi.org/10.1007/s10107-025-02239-8openalex-snapshot
Fast Combinatorial Algorithms for Efficient Sortation
inferred← citeshttps://doi.org/10.1007/s10255-024-1149-9openalex-snapshot
Some Results on the Existence of Spanning k-ended Trees in a t-connected Graph
inferred← citeshttps://doi.org/10.1007/s10587-016-0300-zopenalex-snapshot
Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs
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/s41980-020-00375-9openalex-snapshot
Spanning Trees of Bounded Degree, Connectivity, Toughness, and the Spectrum of a Graph
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.dam.2012.03.025openalex-snapshot
On the approximability of some degree-constrained subgraph problems
inferred← citeshttps://doi.org/10.1016/j.dam.2018.07.005openalex-snapshot
The existence of f -forests and f -trees in graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2020.03.035openalex-snapshot
Toughness and prism-hamiltonicity of P4 -free graphs
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.dam.2026.03.025openalex-snapshot
A result on spanning trees with bounded total excess
inferred← citeshttps://doi.org/10.1016/j.disc.2015.02.022openalex-snapshot
Spanning trees and spanning Eulerian subgraphs with small degrees
inferred← citeshttps://doi.org/10.1016/j.disc.2019.111709openalex-snapshot
The Chvátal–Erdős condition for prism-Hamiltonicity
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112998openalex-snapshot
Spanning trees and spanning closed walks with small degrees
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114593openalex-snapshot
Spectral extremal problems on factors in tough graphs, and beyond
inferred← citeshttps://doi.org/10.1016/j.ejc.2021.103468openalex-snapshot
A tight lower bound on the matching number of graphs via Laplacian eigenvalues
inferred← citeshttps://doi.org/10.1016/j.laa.2024.10.023openalex-snapshot
Spectral radius, odd [1,b]-factor and spanning k-tree of 1-binding graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00247-4openalex-snapshot
Partitioning vertices of 1-tough graphs into paths
inferred← citeshttps://doi.org/10.1017/cbo9780511977152openalex-snapshot
Iterative Methods in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1017/s0963548316000018openalex-snapshot
Shape Measures of Random Increasing k-trees
inferred← citeshttps://doi.org/10.1051/ro/2018044openalex-snapshot
Average covering number for some 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.1080/15427951.2014.982312openalex-snapshot
On the Power of Planned Infections in Networks
inferred← citeshttps://doi.org/10.1134/s0001434623600576openalex-snapshot
The $$A_{\alpha}$$-Spectral Radius and Spanning Trees of Graphs
inferred← citeshttps://doi.org/10.1145/1250790.1250887openalex-snapshot
Approximating minimum bounded degree spanning trees to within one of optimal
inferred← citeshttps://doi.org/10.1145/2591796.2591813openalex-snapshot
Polynomial bounds for the grid-minor theorem
inferred← citeshttps://doi.org/10.1145/2629366openalex-snapshot
Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal
inferred← citeshttps://doi.org/10.1145/2820609openalex-snapshot
Polynomial Bounds for the Grid-Minor Theorem
inferred← citeshttps://doi.org/10.1145/3584372.3588671openalex-snapshot
Node-Differentially Private Estimation of the Number of Connected Components
inferred← citeshttps://doi.org/10.1145/3762664openalex-snapshot
Node-Differentially Private Estimation of the Number of Connected Components
inferred← citeshttps://doi.org/10.1155/jom/9961860openalex-snapshot
Sufficient Conditions for Spanning k ‐Hypertrees via Distance Spectral Radius of Hypergraphs
inferred← citeshttps://doi.org/10.2298/fil2429345lopenalex-snapshot
A note on graphs containing spanning trees with bounded leaf degree
inferred← citeshttps://doi.org/10.2298/fil2502639wopenalex-snapshot
An Aα-spectral radius for a spanning tree with constrained leaf distance in a graph
inferred← citeshttps://doi.org/10.26493/1855-3974.981.ff0openalex-snapshot
Improving upper bounds for the distinguishing index
inferred← citeshttps://doi.org/10.37236/635openalex-snapshot
Toughness of $K_{a,t}$-Minor-free Graphs
inferred← citeshttps://doi.org/10.4230/lipics.disc.2019.14openalex-snapshot
The Capacity of Smartphone Peer-To-Peer Networks
inferred← citeshttps://doi.org/10.48550/arxiv.0810.5477openalex-snapshot
Worst-case time decremental connectivity and k-edge witness
inferred← citeshttps://doi.org/10.48550/arxiv.1806.00135openalex-snapshot
Packing spanning partition-connected subgraphs with small degrees
inferred← citeshttps://doi.org/10.48550/arxiv.1901.01959openalex-snapshot
Toughness and prism-hamiltonicity of $P_4$-free graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1905.12161openalex-snapshot
Bipartite partition-connected factors with small degrees
inferred← citeshttps://doi.org/10.48550/arxiv.2011.03194openalex-snapshot
Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems
inferred← citeshttps://doi.org/10.5555/2884435.2884448openalex-snapshot
Online degree-bounded steiner network design
inferred← citeshttps://doi.org/10.5802/alco.197openalex-snapshot
Graph toughness from Laplacian eigenvalues
inferred← citeshttps://doi.org/10.5821/dissertation-2117-94554openalex-snapshot
Optimization in graphs under degree constraints. application to telecommunication networks
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.2530openalex-snapshot
Sufficient conditions for spanning trees with constrained leaf distance in a graph
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.