Pages that link to "Item:Q2448873"

The following pages link to Computing and counting longest paths on circular-arc graphs in polynomial time (Q2448873):

Displaying 4 items.

• Detour trees (Q277622) (← links)
• The Hamiltonian connectivity of rectangular supergrid graphs (Q1751246) (← links)
• The longest cycle problem is polynomial on interval graphs (Q2227488) (← links)
• Contracting to a longest path in H-free graphs (Q6065420) (← links)