Abstract
Rectangle intersection graphs are the intersection graphs of axis-parallel rectangles in the plane. A graph G is said to be a k-stabbable rectangle intersection graph, or k-SRIG for short, if it has a rectangle intersection representation in which k horizontal lines can be placed such that each rectangle intersects at least one of them. The stab number of a graph G, denoted by stab(G), is the minimum integer k such that G is a k-SRIG. In this paper, we introduce some natural subclasses of 2-SRIG and study the containment relationships among them. We also give a linear time recognition algorithm for one of those classes. In this paper, we prove that the Chromatic Number problem is NP-complete even for 2-SRIGs. This strengthens a result by Imai and Asano [13]. We also show that triangle-free 2-SRIGs are three colorable.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Asinowski, A., Cohen, E., Golumbic, M.C., Limouzy, V., Lipshteyn, M., Stern, M.: Vertex intersection graphs of paths on a grid. J. Graph Algorithms Appl. 16(2), 129–150 (2012)
Benzer, S.: On the topology of the genetic fine structure. Proc. Natl. Acad. Sci. 45(11), 1607–1620 (1959)
Bhore, S.K., Chakraborty, D., Das, S., Sen, S.: On a special class of boxicity 2 graphs. In: Ganguly, S., Krishnamurti, R. (eds.) CALDAM 2015. LNCS, vol. 8959, pp. 157–168. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-14974-5_16
Bhore, S., Chakraborty, D., Das, S., Sen, S.: On local structures of cubicity 2 graphs. In: Chan, T.-H.H., Li, M., Wang, L. (eds.) COCOA 2016. LNCS, vol. 10043, pp. 254–269. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-48749-6_19
Bogart, K.P., West, D.B.: A short proof that ‘proper = unit’. Discret. Math. 201(1–3), 21–23 (1999)
Chakraborty, D., Francis, M.C., On the stab number of rectangle intersection graphs. CoRR, abs/1804.06571 (2018)
Chaplick, S., Cohen, E., Stacho, J.: Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid. In: Kolman, P., KratochvÃl, J. (eds.) WG 2011. LNCS, vol. 6986, pp. 319–330. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-25870-1_29
Corneil, D.G., Olariu, S., Stewart, L.: The LBFS structure and recognition of interval graphs. SIAM J. Discret. Math. 23(4), 1905–1953 (2009)
Cornelsen, S., Schank, T., Wagner, D.: Drawing graphs on two and three lines. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 31–41. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-36151-0_4
Cygan, M., et al.: Parameterized Algorithms, vol. 3. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21275-3
Dvořák, Z., Kawarabayashi, K., Thomas, R.: Three-coloring triangle-free planar graphs in linear time. ACM Trans. Algorithms 7(4), 41:1–41:14 (2011)
Garey, M.R., Johnson, D.S., Miller, G.L., Papadimitriou, C.H.: The complexity of coloring circular arcs and chords. SIAM J. Algebr. Discret. Methods 1(2), 216–227 (1980)
Imai, H., Asano, T.: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane. J. Algorithms 4(4), 310–323 (1983)
Kleinberg, J., Tardos, E.: Algorithm Design. Pearson Education India, Bangalore (2006)
KratochvÃl, J.: A special planar satisfiability problem and a consequence of its NP-completeness. Discret. Appl. Math. 52(3), 233–252 (1994)
Lekkerkerker, C., Boland, J.: Representation of a finite graph by a set of intervals on the real line. Fundamenta Mathematicae 51(1), 45–64 (1962)
Perepelitsa, I.G.: Bounds on the chromatic number of intersection graphs of sets in the plane. Discret. Math. 262(1–3), 221–227 (2003)
West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddle River (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Chakraborty, D., Das, S., Francis, M.C., Sen, S. (2019). On Rectangle Intersection Graphs with Stab Number at Most Two. In: Pal, S., Vijayakumar, A. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2019. Lecture Notes in Computer Science(), vol 11394. Springer, Cham. https://doi.org/10.1007/978-3-030-11509-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-030-11509-8_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-11508-1
Online ISBN: 978-3-030-11509-8
eBook Packages: Computer ScienceComputer Science (R0)