A characterization of biconnected graphs reachable by robots jumping over \(m\) obstacles (Q2413355)
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: A characterization of biconnected graphs reachable by robots jumping over \(m\) obstacles |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of biconnected graphs reachable by robots jumping over \(m\) obstacles |
scientific article |
Statements
A characterization of biconnected graphs reachable by robots jumping over \(m\) obstacles (English)
0 references
10 April 2018
0 references
bi-connected graphs
0 references
\( mRJ\)-moves
0 references
\( mRJ\)-reachability
0 references
