Author:
Babel Luitpold,Brandstädt Andreas,Le Van Bang
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference12 articles.
1. L. Babel, On the P4-structure of graphs, Habilitation thesis, Zentrum Mathematik, Technische Universität München, 1997.
2. L. Babel, S. Olariu, On the separable-homogeneous decomposition of graphs, in: R.H. Möhring (Ed.), Graph-Theoretic Concepts in Computer Science, 23th International Workshop, WG’97, Lecture Notes in Computer Science, vol. 1335, Springer, Berlin, 1997, pp. 25–37.
3. L. Babel, S. Olariu, On the p-connectedness of graphs – a survey, Discrete Appl. Math., to appear.
4. A. Brandstädt, V.B. Le, Recognizing the P4-structure of block graphs, Discrete Appl. Math., to appear.
5. A. Brandstädt, V.B. Le, S. Olariu, Linear-time recognition of the P4-structure of trees, Rutcor Research Report RRR 19-96, Rutgers University, 1996.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Parameterized algorithms for Edge Biclique and related problems;Theoretical Computer Science;2018-07
2. Split-Perfect Graphs: Characterizations and Algorithmic Use;SIAM Journal on Discrete Mathematics;2004-01
3. Bipartite-perfect graphs;Discrete Applied Mathematics;2003-05
4. Split-Perfect Graphs: Characterizations and Algorithmic Use;Graph-Theoretic Concepts in Computer Science;2000
5. Bipartite-Perfect Graphs;Electronic Notes in Discrete Mathematics;1999-05