Properties of edge-tough graphs (Q1808717): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s003730050065 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2006781893 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:52, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Properties of edge-tough graphs |
scientific article |
Statements
Properties of edge-tough graphs (English)
0 references
16 February 2000
0 references
The author of the article introduced in [Discrete Math. 164, No. 1-3, 187-196 (1997; Zbl 0874.05035)] the notion of edge-toughness and investigated the relations between edge-toughness and `classical' toughness. In particular, it was proved that every \(2t\)-tough graph is \(t\)-edge-tough. The present paper is the continuation of this research. It is shown that if a graph \(G\) with at least three vertices is 1-edge-tough then \(G\) has a 2-factor. This is a sharpening of a known result of \textit{H. Enomoto, B. Jackson, P. Katarinis}, and \textit{A. Saito} [J. Graph Theory 9, No. 1, 87-95 (1985; Zbl 0598.05054)].
0 references
toughness
0 references
edge-toughness
0 references
hamiltonicity
0 references
\(k\)-factors
0 references
