Information Technology Reference
In-Depth Information
References
1. Alon, N., Mubayi, D., Thomas, R.: Large induced forests in sparse graphs. J. Graph
Theory 113, 113-123 (2001) MR 1859785
2. Borradaile, G., Eppstein, D., Zhu, P.: Planar induced subgraphs of sparse graphs
(2014), arXiv:1408.5939
3. Borradaile, G., Klein, P., Marx, D., Mathieu, C.: Algorithms for Optimization
Problems in Planar Graphs (Dagstuhl Seminar 13421). Dagstuhl Reports 3(10),
36-57 (2014)
4. Calinescu, G., Fernandes, C.G., Finkler, U., Karloff, H.: A better approximation
algorithm for finding planar subgraphs. J. Algorithms 27(2), 269-302 (1998) MR
1622397
5. Cheng, C., McDermid, E., Suzuki, I.: Planarization and acyclic colorings of sub-
cubic claw-free graphs. In: Kolman, P., Kratochvıl, J. (eds.) WG 2011. LNCS,
vol. 6986, pp. 107-118. Springer, Heidelberg (2011) MR 2914703
6. Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms
for the Visualization of Graphs, 1st edn. Prentice-Hall (1998)
7. Edwards, K., Farr, G.: An algorithm for finding large induced planar subgraphs.
In:Mutzel,P.,Junger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 75-80.
Springer, Heidelberg (2002) MR 2410446
8. Edwards, K., Farr, G.: Planarization and fragmentability of some classes of graphs.
Discrete Math. 308(12), 2396-2406 (2008) MR 2410446
9. Edwards, K., Farr, G.: Improved upper bounds for planarization and series-
parallelization of degree-bounded graphs. Electron. J. Combin. 19(2), P25 (2012)
MR 2928640
10. Halldorsson, M.M., Lau, H.C.: Low-degree graph partitioning via local search with
applications to constraint satisfaction, max cut, and coloring. J. Graph Algorithms
Appl. 1(3), 1-13 (1997) MR 1600712
11. Kawarabayashi, K.-I.: Planarity allowing few error vertices in linear time. In: 50th
Annual IEEE Symposium on Foundations of Computer Science (FOCS 2009), pp.
639-648 (2009) MR 2648441
12. Kawarabayashi, K.-I., Reed, B.: Computing crossing number in linear time. In: Pro-
ceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing
(STOC 2007), pp. 382-390 (2007) MR 2402463
13. Kostochka, A.V.: The minimum Hadwiger number for graphs with a given mean
degree of vertices. Metody Diskret. Analiz 38, 37-58 (1982) MR 0713722
14. Kostochka, A.V.: Lower bound of the Hadwiger number of graphs by their average
degree. Combinatorica 4(4), 307-316 (1984) MR 0779891
15. Lubotzky, A., Philips, R., Sarnak, R.: Ramanujan graphs. Combinatorica 8,
261-277 (1988) MR 0963118
16. Morgan, K., Farr, G.: Approximation algorithms for the maximum induced planar
and outerplanar subgraph problems. J. Graph Algorithms Appl. 11(1), 165-193
(2007) MR 2354168
17. Thomason, A.: An extremal function for contractions of graphs. Math. Proc.
Cambridge Philos. Soc. 95(2), 261-265 (1984) MR 0735367
18. Thomason, A.: The extremal function for complete minors. J. Combinatorial
Theory, Series B 81(2), 318-338 (2001) MR 1814910
