Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space (Q3183622)
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: Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space |
scientific article |
Statements
Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space (English)
0 references
20 October 2009
0 references
