On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs (Q2268880): Difference between revisions
From MaRDI portal
Latest revision as of 12:25, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs |
scientific article |
Statements
On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs (English)
0 references
9 March 2010
0 references
chordless paths
0 references
bipartite graphs
0 references
interval operators
0 references
graph convexity
0 references
simple paths
0 references
even-chorded paths
0 references