Pages that link to "Item:Q3143733"

The following pages link to Vertex Intersection Graphs of Paths on a Grid (Q3143733):

Displaying 34 items.

• Intersection graphs of L-shapes and segments in the plane (Q277615) (← links)
• VPG and EPG bend-numbers of Halin graphs (Q323044) (← links)
• Max point-tolerance graphs (Q344833) (← links)
• Characterizations of cographs as intersection graphs of paths on a grid (Q741533) (← links)
• CPG graphs: some structural and hardness results (Q827595) (← links)
• Good spanning trees in graph drawing (Q897943) (← links)
• On contact graphs of paths on a grid (Q1725765) (← 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)
• On dominating set of some subclasses of string graphs (Q2144448) (← links)
• Characterising circular-arc contact \(B_0\)-VPG graphs (Q2192099) (← links)
• Characterization of 2-path signed network (Q2221636) (← links)
• Bounds on the bend number of split and cocomparability graphs (Q2322713) (← links)
• Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames (Q2331213) (← links)
• The maximum clique problem in multiple interval graphs (Q2350898) (← links)
• Vertex intersection graphs of paths on a grid: characterization within block graphs (Q2409505) (← links)
• A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs (Q2423295) (← links)
• On \(k\)-bend and monotonic \(\ell\)-bend edge intersection graphs of paths on a grid (Q2691570) (← links)
• Single bend paths on a grid have strong helly number 4: <i>errata atque emendationes ad</i> “edge intersection graphs of single bend paths on a grid” (Q2811306) (← links)
• String graphs of k-bend paths on a grid (Q2840697) (← links)
• Vertex Contact Graphs of Paths on a Grid (Q2945180) (← links)
• Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid (Q3104787) (← links)
• Maximum Independent Set on $$B_1$$ B 1 -VPG Graphs (Q3467876) (← links)
• Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames (Q5005138) (← links)
• Characterization and a 2D Visualization of B$$_{0}$$-VPG Cocomparability Graphs (Q5014117) (← links)
• On approximating MIS over B1-VPG graphs* (Q5057743) (← links)
• Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid (Q5886040) (← links)
• Computing maximum independent set on outerstring graphs and their relatives (Q5918655) (← links)
• On rectangle intersection graphs with stab number at most two (Q5919053) (← links)
• Posets and VPG graphs (Q5965140) (← links)
• Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs (Q6064836) (← links)
• B0-VPG Representation of AT-free Outerplanar Graphs (Q6202310) (← links)
• Recognizing geometric intersection graphs stabbed by a line (Q6204544) (← links)
• A survey on variant domination problems in geometric intersection graphs (Q6536206) (← links)