Optimal Embedding of Graphs with Nonconcurrent Longest Paths in Archimedean Tessellations

<div>Graph <span class="nowrap"><svg height="13.5868pt" id="M74" 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

fig12

Figure 12

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