On rectangle intersection graphs with stab number at most two

DOI10.1007/978-3-030-11509-8_11MaRDI QIDQ5919634zbMATH OpenOpenAlexFDO

Authors Dibyayan Chakraborty, Sandip Das, Mathew C. Francis, Sagnik Sen

Publication date 10 October 2019

Published in Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-11509-8_11

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• On rectangle intersection graphs with stab number at most two
• On the stab number of rectangle intersection graphs
• On a special class of boxicity 2 graphs
• On rectangle intersection and overlap graphs
• Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane

Cited in

(6)

• On local structures of cubicity 2 graphs
• On a special class of boxicity 2 graphs
• On rectangle intersection graphs with stab number at most two
• Stable 2-pairs and (X,Y)-intersection graphs
• The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n-2
• On the stab number of rectangle intersection graphs

This page was built for publication: On rectangle intersection graphs with stab number at most two

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919634)