The following pages link to (Q4501713):
Displaying 6 items.
- On contact graphs of paths on a grid (Q1725765) (← links)
- On some special classes of contact \(B_0\)-VPG graphs (Q2064288) (← links)
- Finding geometric representations of apex graphs is NP-hard (Q2154093) (← links)
- Characterising circular-arc contact \(B_0\)-VPG graphs (Q2192099) (← links)
- Packing \([1, \Delta ]\)-factors in graphs of small degree (Q2460103) (← links)
- Finding geometric representations of apex graphs is \textsf{NP}-hard (Q6175518) (← links)
