Author:
van ’t Hof Pim,Kamiński Marcin,Paulusma Daniël
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference38 articles.
1. Arkin, E.M., Papadimitriou, C.H., Yannakakis, M.: Modularity of cycles and paths in graphs. J. ACM 38(2), 255–274 (1991)
2. Arikati, S.R., Peled, U.N.: A linear algorithm for the group path problem on chordal graphs. Discrete Appl. Math. 44(1–3), 185–190 (1993)
3. Arikati, S.R., Peled, U.N.: A polynomial algorithm for the parity path problem on perfectly orientable graphs. Discrete Appl. Math. 65(1), 5–20 (1996)
4. Arikati, S.R., Rangan, C.P., Manacher, G.K.: Efficient reduction for path problems on circular-arc graphs. BIT Numer. Math. 31(2), 182–193 (1991)
5. Berge, C.: Färbung von Graphen, deren sämtliche bzw. deren ungerade Kreise starr sind. Wiss. Z., Martin-Luther-Univ. Halle-Wittenb., Math.-Nat.wiss. Reihe 10, 114 (1961)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Three-in-a-tree in near linear time;Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing;2020-06-06
2. Claw-Free $t$-Perfect Graphs Can Be Recognized in Polynomial Time;SIAM Journal on Discrete Mathematics;2016-01
3. Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time;Integer Programming and Combinatorial Optimization;2014