Author:
Häggkvist Roland,McGuinness Sean
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference9 articles.
1. R.E.L. Aldred, Bau Sheng, D.A. Holton, G.F. Royle, All the small snarks, preprint, 1987.
2. Graph Theory with Applications;Bondy,1976
3. A. Cavicchioli, M. Meschiari, B. Ruini, F. Spaggiari, A survey on snarks and new results: products, reducibility, and a computer search, J. Graph Theory (1998) 57–86.
4. Eine gemeinsame basis für die theorie der eulerischen graphen und den satz von Petersen;Fleischner;Monatsh. Math.,1976
5. Cycle Double Covers of Graphs with Hamilton Paths;Goddyn;J. Combin. Theory Ser. B,1989
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Approximate Cycle Double Cover;Lecture Notes in Computer Science;2024
2. 5-Cycle Double Covers, 4-Flows, and Catlin Reduction;SIAM Journal on Discrete Mathematics;2023-02-03
3. Snarks with Resistance $n$ and Flow Resistance $2n$;The Electronic Journal of Combinatorics;2022-03-11
4. Cubic graphs having only k-cycles in each 2-factor;Discussiones Mathematicae Graph Theory;2022
5. The smallest nontrivial snarks of oddness 4;Discrete Applied Mathematics;2020-04