Author:
Hammack Richard H.,Kainen Paul C.
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference22 articles.
1. Diestel, R.: Graph Theory, Graduate Texts in Mathematics, vol. 173, 3rd edn. Springer, Berlin (2005)
2. Dixon, E.T., Goodman, S.E.: An algorithm for the longest cycle problem. Networks 6, 139–146 (1976)
3. Eppstein, D.: StackExchange, April 20, 2015 (on-line discussion). http://cstheory.stackexchange.com/questions/31203/what-is-the-best-way-to-find-an-induced-cycle-basis-of-a-graph
4. Galluccio, A., Loebl, M.: $$(p, q)$$ ( p , q ) -odd digraphs. J. Graph Theory 23(2), 175–184 (1996)
5. Hammack, R.H., Kainen, P.C.: Robust cycle bases do not exist for $$K_{n, n}$$ K n , n if $$n \ge 8$$ n ≥ 8 . Discrete Appl. Math. 235, 206–211 (2018)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献