Optimal Embedding of Graphs with Nonconcurrent Longest Paths in Archimedean Tessellations

<div>Graph <span class="nowrap"><svg height="11.4859pt" id="M20" style="vertical-align:-0.04979992pt" version="1.1" viewbox="-0.0498162 -11.4361 11.9462 11.4859" width="11.9462pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M600 480C600 590 528 650 384 650H143L137 622C222 614 225 607 210 531L130 127C113 41 106 36 23 28L17 0H294L300 28C204 36 195 42 212 127L243 284L314 263C327 263 339 263 352 264C465 271 600 337 600 480ZM508 481C508 351 402 304 329 304C289 304 265 311 250 317L295 559C302 594 310 606 323 611C335 616 350 619 367 619C455 619 508 573 508 481Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,8.026,-5.741)"><path d="M310 541L304 571C290 586 211 619 185 610L80 76L131 52L310 541Z"></path></g></svg>.</span></div>

Complexity

fig3

Figure 3

Figure 3: Optimal Embedding of Graphs with Nonconcurrent Longest Paths in Archimedean Tessellations 