Abstract
We define and study a class of graphs, called 2-stab interval graphs (2SIG), with boxicity 2 which properly contains the class of interval graphs. A 2SIG is an axes-parallel rectangle intersection graph where the rectangles have unit height (that is, length of the side parallel to Y-axis) and intersects either of the two fixed lines, parallel to the X-axis, distance 1 + ε (0 < ε < 1) apart. Intuitively, 2SIG is a graph obtained by putting some edges between two interval graphs in a particular rule. It turns out that for these kind of graphs, the chromatic number of any of its induced subgraphs is bounded by twice of its (induced subgraph) clique number. This shows that the graph, even though not perfect, is not very far from it. Then we prove similar results for some subclasses of 2SIG and provide efficient algorithm for finding their clique number. We provide a matrix characterization for a subclass of 2SIG graph.
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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alexe, G., Alexe, S., Crama, Y., Foldes, S., Hammer, P.L., Simeone, B.: Consensus algorithms for the generation of all maximal bicliques. Discrete Applied Mathematics 145(1), 11–21 (2004); Graph Optimization IV
Brandstädt, A., Spinrad, J.P.: Graph classes: a survey, vol. 3. SIAM (1999)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, 2nd edn. Annals of Discrete Mathematics. Elsevier Science (2004)
Gyárfás, A.: Problems from the world surrounding perfect graphs. Applicationes Mathematicae 19(3-4), 413–441 (1987)
Gyárfás, A., Li, Z., Machado, R., Sebo, A., Thomassé, S., Trotignon, N.: Complements of nearly perfect graphs. ar**v preprint ar**v:1304.2862 (2013)
Hell, P., Huang, J.: Interval bigraphs and circular arc graphs. Journal of Graph Theory 46(4), 313–327 (2004)
Ibarra, L.: The clique-separator graph for chordal graphs. Discrete Applied Mathematics 157(8), 1737–1749 (2009)
Kostochka, A.: Coloring intersection graphs of geometric figures with a given clique number. Contemporary Mathematics 342, 127–138 (2004)
McConnell, R.M., Spinrad, J.P.: Linear-time modular decomposition and efficient transitive orientation of comparability graphs. In: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 536–545. Society for Industrial and Applied Mathematics (1994)
Mertzios, G.B.: A matrix characterization of interval and proper interval graphs. Applied Mathematics Letters 21(4), 332–337 (2008)
Zhang, P.: Probe interval graphs and its applications to physical map** of dna (1994) (unpublished manuscript)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Bhore, S.K., Chakraborty, D., Das, S., Sen, S. (2015). On a Special Class of Boxicity 2 Graphs. In: Ganguly, S., Krishnamurti, R. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2015. Lecture Notes in Computer Science, vol 8959. Springer, Cham. https://doi.org/10.1007/978-3-319-14974-5_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-14974-5_16
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-14973-8
Online ISBN: 978-3-319-14974-5
eBook Packages: Computer ScienceComputer Science (R0)