Corpus ID: 115132821

Minimally toughness in special graph classes

@article{Katona2018MinimallyTI,
  title={Minimally toughness in special graph classes},
  author={G. Katona and Kitti Varga},
  journal={arXiv: Combinatorics},
  year={2018}
}
Let $t$ be a positive real number. A graph is called $t$-tough, if the removal of any cutset $S$ leaves at most $|S|/t$ components. The toughness of a graph is the largest $t$ for which the graph is $t$-tough. A graph is minimally $t$-tough, if the toughness of the graph is $t$ and the deletion of any edge from the graph decreases the toughness. In this paper we investigate the minimum degree and the recognizability of minimally $t$-tough graphs in the class of chordal graphs, split graphs… Expand

Figures from this paper

References

SHOWING 1-10 OF 11 REFERENCES
The complexity of recognizing minimally tough graphs
TLDR
This paper proves that recognizing minimally-tough graphs is DP-complete for any positive rational number $t$ and introduces a new notion called weighted toughness, which has a key role in the proof. Expand
Properties of minimally t-tough graphs
TLDR
It is proved that every minimally $1$-tough claw-free graph is a cycle and that for every $t \in \mathbb{Q}$ any graph can be embedded as an induced subgraph into a minimally £t-t Tough graph. Expand
On Toughness and Hamiltonicity of 2K2-Free Graphs
TLDR
It is proved that the problem of determining toughness is polynomially solvable and that Chvatal's toughness conjecture is true for 2K2-free graphs. Expand
Toughness, hamiltonicity and split graphs
TLDR
It is shown that every 3 2 - tough split graph is hamiltonian and that there is a sequence of non-hamiltonian split graphs with toughness converging to 3 2 . Expand
The toughness of split graphs
TLDR
It is argued that the toughness of split graphs can be computed in polynomial time and this solves an open problem from a recent paper by Kratsch et al. Expand
Hamiltonian results in K1, 3-free graphs
TLDR
It is shown that the square and the total graph of a K1,3-free graph are vertex pancyclic and some of the relationships between connectivity and Hamiltonian properties in K 1,3,free graphs are discussed. Expand
Eine Eigenschaft der Atome endlicher Graphen
Tough graphs and hamiltonian circuits
Problems from the workshop on dominating cycles, http: // iti
  • zcu. cz/ history/2003/Hajek/problems/hajek-problems.ps
  • 2003
Toughness
  • hamiltonicity and split graphs, Discrete Mathematics 150
  • 1996
...
1
2
...