Pages that link to "Item:Q5200514"
From MaRDI portal
The following pages link to Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill (Q5200514):
Displaying 15 items.
- CPG graphs: some structural and hardness results (Q827595) (← links)
- On some special classes of contact \(B_0\)-VPG graphs (Q2064288) (← links)
- Characterization of \(\mathrm{B}_0\)-VPG cocomparability graphs and a 2D visualization of their posets (Q2088073) (← links)
- Finding geometric representations of apex graphs is NP-hard (Q2154093) (← links)
- Characterising circular-arc contact \(B_0\)-VPG graphs (Q2192099) (← links)
- Bounds on the bend number of split and cocomparability graphs (Q2322713) (← links)
- On edge intersection graphs of paths with 2 bends (Q2357780) (← links)
- On Edge Intersection Graphs of Paths with 2 Bends (Q3181059) (← links)
- Maximum Independent Set on $$B_1$$ B 1 -VPG Graphs (Q3467876) (← links)
- Characterization and a 2D Visualization of B$$_{0}$$-VPG Cocomparability Graphs (Q5014117) (← links)
- Computing maximum independent set on outerstring graphs and their relatives (Q5918655) (← links)
- Space-efficient algorithms for reachability in directed geometric graphs (Q6039899) (← links)
- \(B_0\)-VPG representation of AT-free outerplanar graphs (Q6102269) (← links)
- Finding geometric representations of apex graphs is \textsf{NP}-hard (Q6175518) (← links)
- B0-VPG Representation of AT-free Outerplanar Graphs (Q6202310) (← links)
