Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference18 articles.
1. Every planar map is four colorable;Appel;Bull. Amer. Math. Soc.,1976
2. Shortest coverings of graphs with cycles;Bermond;J. Combin. Theory (B),1983
3. Graph Theory with Applications;Bondy,1976
4. A reduction method to find spanning eulerian subgraphs;Catlin;J. Graph Theory,1988
5. Double cycle covers and the Petersen graph;Catlin;J. Graph Theory,1989
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献