DisjointT-paths in tough graphs
From MaRDI portal
Publication:3528155
Recommendations
- scientific article; zbMATH DE number 5259899
- scientific article; zbMATH DE number 123960
- Partitioning vertices of 1-tough graphs into paths
- Toughness and the existence of \(k\)-factors. III
- Toughness of graphs and the existence of factors
- Toughness and the existence ofk-factors
- On Path-Tough Graphs
- scientific article; zbMATH DE number 109208
- Note: a short proof of a theorem of Tutte
- Isolated toughness and existence of \([a,b]\)-factors in graphs
Cites work
Cited in
(2)
This page was built for publication: DisjointT-paths in tough graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3528155)