Local topological toughness and local factors

DOI10.1007/S00373-007-0736-XMaRDI QIDQ2385135zbMATH OpenOpenAlexFDO

Authors Gyula Y. Katona, Frank Göring

Publication date 11 October 2007

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-007-0736-x

Mathematics Subject Classification ID

Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Toughness and the existence ofk-factors
• scientific article; zbMATH DE number 165068
• Toughness of graphs and the existence of factors
• Toughness and the existence of \(k\)-factors. III
• scientific article; zbMATH DE number 109208

Cites work

• 4‐chrome Graphen und vollständige 4‐Graphen
• scientific article; zbMATH DE number 16299 (Why is no real title available?)
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• On cycles through specified vertices
• On paths and cycles through specified vertices
• On short cycles through prescribed vertices of a graph
• Properties of edge-tough graphs
• Tough graphs and Hamiltonian circuits.
• Toughness and edge-toughness
• Toughness and the existence ofk-factors
• When m vertices in a k-connected graph cannot be walked round along a simple cycle
• Über die Maximalzahl kreuzungsfreier H-Wege
• Über ein graphentheoretisches Problem von T. Gallai

This page was built for publication: Local topological toughness and local factors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2385135)