Some results on graphs without long induced paths

Information Processing Letters

Volumn 88, Issue 4, 2003, Pages 167-171

  Lozin, Vadim ^a   Rautenbach, Dieter ^b  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF BONN   (Germany)

Author keywords

Algorithms; Computational complexity; Forbidden induced subgraph; Graph algorithms; Independent set

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING;

GRAPH ALGORITHMS;

GRAPH THEORY;

EID: 0142106796     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2003.07.004     Document Type: Article

References (15)

1. V.E. Alekseev, On easy and hard hereditary classes of graphs with respect to the independent set problem, Discrete Appl. Math., in press; doi: 10.1016/S0166-218X(03)00387-1.
2. 5-free and more general graphs. Discrete Appl. Math. 95:1999;163-167.
3. Cameron K. Induced matchings. Discrete Appl. Math. 24:1989;97-102.
4. Fricke G., Laskar R. Strong matchings on trees. Congr. Numer. 89:1992;239-243.
5. 5-free graphs. Discrete Appl. Math. 125:2003;215-224.
6. Golumbic M.C., Laskar R.C. Irredundancy in circular arc graphs. Discrete Appl. Math. 44:1993;79-89.
7. Golumbic M.C., Lewenstein M. New results on induced matchings. Discrete Appl. Math. 101:2000;157-165.
8. Graham R.L., Rothschild B.L., Spencer J.H. Ramsey Theory. 1980;Wiley, New York.
9. Holyer I. The NP-completeness of edge-coloring. SIAM J. Comput. 10:1981;718-720.
10. Korobitsyn D.V. On the complexity of determining the domination number in monogenic classes of graphs. Diskret. Mat. 2:(3):1990;90-96. (in Russian); transl. in Discrete Math. Appl. 2:(2):1992;191-199.
11. Korobitsyn D.V. On the complexity of determining the domination number in monogenic classes of graphs. Diskret. Mat. 2:(3):1990;90-96. (in Russian); transl. in Discrete Math. Appl. 2:(2):1992;191-199.
12. 5-free graphs. Inform. Process. Lett. 61:1997;137-143.
13. 5-free graphs, Discrete Appl. Math., in press; doi: 10.1016/S0166-218X(03)00399-8.
14. Sgall J., Wöginger G.J. The complexity of coloring graphs without long induced paths. Acta Cybernet. 15:2001;107-117.
15. Yannakakis M. Node-deletion problems on bipartite graphs. SIAM J. Comput. 10:1981;310-327.