Discontinuities in the complexities of some graph recognition problems (Q2848780)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Discontinuities in the complexities of some graph recognition problems |
scientific article; zbMATH DE number 6212217
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Discontinuities in the complexities of some graph recognition problems |
scientific article; zbMATH DE number 6212217 |
Statements
26 September 2013
0 references
matching cutset
0 references
Discontinuities in the complexities of some graph recognition problems (English)
0 references
The author introduces the notion of a complexity jump. However, only one result is shown which states that every connected graph of order at least 8 with maximum degree 3 has a matching cutset. This result has already appeared in the author's earlier paper [J. Graph Theory 13, No. 5, 527--536 (1989; Zbl 0725.05055)].
0 references
0.7413480877876282
0 references
0.7068935036659241
0 references
0.7024520635604858
0 references
