Subject
General Computer Science,Theoretical Computer Science
Reference16 articles.
1. 3-coloring in time O(1.3289n);Beigel;J. Algorithms,2005
2. Snarks and reducibility;Brinkmann;Ars Combin.,1998
3. Applications of matching and edge-coloring algorithms to routing in closed networks;Carpinelli;Networks,1994
4. A survey on snarks and new results: Products, reducibility and a computer search;Cavicchioli;J. Graph Theory,1998
5. The traveling salesman problem for cubic graphs;Eppstein,2003
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献