DisjointT-paths in tough graphs

DOI10.1002/JGT.20316MaRDI QIDQ3528155zbMATH OpenOpenAlexFDO

Authors 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)

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

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

Cited in

(2)

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

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)