DisjointT-paths in tough graphs

DOI10.1002/JGT.20316zbMath1165.05015OpenAlexW4237530249MaRDI QIDQ3528155

Tomáš Kaiser

Publication date: 8 October 2008

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20316

zbMATH Keywords

vertex-disjoint pathstough graphs\(1\)-factorgraft\(T\)-path

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Factors with red-blue coloring of claw-free graphs and cubic graphs ⋮ Degree factors with red-blue coloring of regular graphs

Cites Work

• Über die Maximalzahl kreuzungsfreier H-Wege
• A short proof of Mader's \(\mathcal S\)-paths theorem
• T‐joins intersecting small edge‐cuts in graphs
• The Factorization of Linear Graphs

This page was built for publication: DisjointT-paths in tough graphs