Recognizing \(P_ 3\)-structure: A switching approach (Q1924124)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 934791
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recognizing \(P_ 3\)-structure: A switching approach |
scientific article; zbMATH DE number 934791 |
Statements
Recognizing \(P_ 3\)-structure: A switching approach (English)
0 references
11 March 1997
0 references
A 3-uniform hypergraph is the \(P_3\)-structure of a graph when the graph contains an induced path on three vertices exactly when the three vertices form a hyperedge of the hypergraph. Using Seidel switching, an efficient algorithm is presented for recognizing \(P_3\)-structures of graphs.
0 references
hypergraph
0 references
\(P_ 3\)-structure
0 references
path
0 references
Seidel switching
0 references
0.8090379
0 references
0.8088199
0 references
0.7982782
0 references
0.79823625
0 references
0 references
0.78725654
0 references
0.7837639
0 references
