Local topological toughness and local factors
From MaRDI portal
Publication:2385135
DOI10.1007/s00373-007-0736-xzbMath1126.05065OpenAlexW2042182343MaRDI QIDQ2385135
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
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Toughness and edge-toughness
- Properties of edge-tough graphs
- On short cycles through prescribed vertices of a graph
- On paths and cycles through specified vertices
- On cycles through specified vertices
- Tough graphs and Hamiltonian circuits.
- 4‐chrome Graphen und vollständige 4‐Graphen
- Toughness and the existence ofk-factors