Author:
Kano Mikio,Katona Gyula Y.,Varga Kitti
Funder
Japan Society for the Promotion of Science
National Research, Development and Innovation Office NKFIH
Emberi Eroforrások Minisztériuma
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference6 articles.
1. Edmonds, J., Johnson, E.L.: Matching, Euler tours and the Chinese postman. Math. Program. 5(1), 88–124 (1973)
2. Lovász, L.: Combinatorial Problems and Exercises, 2nd edn, pp. 61–61. North-Holland Publishing Co., Amsterdam (1993)
3. Lužar, B., Petruševski, M., Škrekovski, R.: Odd edge coloring of graphs. Ars Math. Contemp. 9, 277–287 (2015)
4. Mátrai, T.: Covering the edges of a graph by three odd subgraphs. J. Graph Theory 53, 75–82 (2006)
5. Petruševski, M.: Odd 4-edge-colorability of graphs. J. Graph Theory 87, 460–474 (2018)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献