Optimal Embedding of Graphs with Nonconcurrent Longest Paths in Archimedean Tessellations

<div>Graphs <svg height="11.6425pt" id="M115" style="vertical-align:-0.2063999pt" version="1.1" viewbox="-0.0498162 -11.4361 12.0767 11.6425" width="12.0767pt" 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="M610 18C585 26 567 34 540 68C517 97 499 128 476 171C452 215 425 276 413 304C496 332 570 394 570 494C570 555 545 595 509 619S419 650 364 650H139L133 622C216 615 219 612 203 527L129 132C112 40 105 36 23 28L17 0H279L285 28C199 34 194 40 211 132L239 284H284C320 284 334 275 351 236C374 182 394 140 420 93C459 23 495 -1 592 -8H600L610 18ZM480 485C480 424 449 372 403 342C374 323 338 316 293 316H245L291 562C296 589 301 601 311 608S337 618 358 618C432 618 480 575 480 485Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,8.151,-5.741)"><path d="M310 541L304 571C290 586 211 619 185 610L80 76L131 52L310 541Z"></path></g></svg> and <span class="nowrap"><svg height="13.5868pt" id="M116" style="vertical-align:-2.1507pt" version="1.1" viewbox="-0.0498162 -11.4361 13.3164 13.5868" width="13.3164pt" 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="M699 368C699 549 574 666 407 666C186 666 23 488 23 277C23 113 129 -3 288 -13L307 -26C431 -111 501 -139 533 -147C559 -154 613 -163 658 -164L666 -141C597 -111 507 -66 430 -11L416 -1C580 42 699 190 699 368ZM601 371C601 227 518 54 381 22L354 40L278 24C175 47 120 145 120 269C120 451 235 631 398 631C540 631 601 521 601 371Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,9.386,-5.741)"><path d="M310 541L304 571C290 586 211 619 185 610L80 76L131 52L310 541Z"></path></g></svg>.</span></div>

Complexity

fig18

Figure 18

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