Abstract
Many important graph classes, such as interval graphs, comparability graphs and AT-free graphs, show some kind of linear structure. In this paper we try to capture the notion of linearity and show some algorithmic implications. In the first section we discuss the notion of linearity of graphs and give some motivation for its usefulness for particular graph classes. The second section deals with the knotting graph, a combinatorial structure that was defined by Gallai long ago and that has various nice properties with respect to our notion of linearity. Next we define intervals of graphs in Sect. 3. This concept generalizes betweenness in graphs—a crucial notion for capturing linear structure in graphs. In the last section we give a practical example of how to use the linear structure of graphs algorithmically. In particular we show how to use these structural insights for finding maximum independent sets in AT-free graphs in \(O(n\overline{m})\) time, where \(\overline{m}\) denotes the number of non-edges of the graph G.
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
Similar content being viewed by others
References
Broersma, H., Kloks, T., Kratsch, D., Müller, H.: Independent sets in asteroidal triple-free graphs. SIAM J. Discret. Math. 12(2), 276–287 (1999)
Corneil, D.G., Köhler, E., Olariu, S., Stewart, L.: Linear orderings of subfamilies of AT-free graphs. SIAM J. Discret. Math. 20(1), 105–118 (2006)
Corneil, D.G., Olariu, S., Stewart, L.: Asteroidal triple-free graphs. SIAM J. Discret. Math. 10(3), 399–430 (1997)
Corneil, D.G., Stacho, J.: Vertex ordering characterizations of graphs of bounded asteroidal number. J. Graph Theory 78(1), 61–79 (2015)
Gallai, T.: Transitiv orientierbare graphen. Acta Math. Acad. Sci. Hung. 18, 25–66 (1967)
Gilmore, P., Hoffman, A.: A characterization of comparability graphs and of interval graphs. Can. J. Math. 16, 539–548 (1964)
Kelly, D.: Comparability graphs. In: Rival, I. (ed.) Graphs and Order, pp. 3–40. D. Reidel Publishing Company, Dordrecht (1985)
Köhler, E.: Recognizing graphs without asteroidal triples. J. Discret. Algorithms 2(4), 439–452 (2004)
Köhler, E., Mouatadid, L.: A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs. Submitted (2015)
McConnell, R.M., Spinrad, J.P.: Modular decomposition and transitive orientation. Discret. Math. 201(1), 189–241 (1999)
Möhring, R.H.: Triangulating graphs without asteroidal triples. Discret. Appl. Math. 64(3), 281–287 (1996)
Parra, A., Scheffler, P.: Characterizations and algorithmic applications of chordal graph embeddings. Discret. Appl. Math. 79(1–3), 171–188 (1997)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Köhler, E. (2015). Linear Structure of Graphs and the Knotting Graph. In: Schulz, A., Skutella, M., Stiller, S., Wagner, D. (eds) Gems of Combinatorial Optimization and Graph Algorithms . Springer, Cham. https://doi.org/10.1007/978-3-319-24971-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-24971-1_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24970-4
Online ISBN: 978-3-319-24971-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)