A characterization of biconnected graphs reachable by robots jumping over \(m\) obstacles (Q2413355): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.endm.2017.11.012 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2774008897 / rank | |||
Normal rank | |||
Revision as of 22:11, 19 March 2024
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
