Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference28 articles.
1. W.M. Brehaut, An efficient outerplanarity algorithm, in: Proc. 8th Southeastern Conference on Combinatorics, Graph Theory and Computing, Baton Rouge, Louisiana, 1977, pp. 99–113.
2. LDFS based certifying algorithm for the minimum path cover problem on cocomparability graphs;Corneil;SIAM J. Comput.,2013
3. Topology of series parallel networks;Duffin;J. Math. Anal. Appl.,1965
4. An O(n+m) certifying triconnnectivity algorithm for Hamiltonian graphs;Elmasry;Algorithmica,2012
5. Parallel recognition of series-parallel graphs;Eppstein;Inform. and Comput.,1992