Maximal nontraceable graphs with toughness less than one (Q1010724): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 01:53, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximal nontraceable graphs with toughness less than one |
scientific article |
Statements
Maximal nontraceable graphs with toughness less than one (English)
0 references
7 April 2009
0 references
Summary: A graph \(G\) is maximal nontraceable (MNT) if \(G\) does not have a Hamiltonian path but, for every \(e\in E(\overline{G}) \), the graph \(G+e\) has a Hamiltonian path. A graph \(G\) is 1-tough if for every vertex cut \(S\) of \(G\) the number of components of \(G-S\) is at most \(|S|\). We investigate the structure of MNT graphs that are not 1-tough. Our results enable us to construct several interesting new classes of MNT graphs.
0 references
maximal nontraceable graph
0 references
MNT
0 references
Hamiltonian path
0 references
tough graphs
0 references
