{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T06:46:57Z","timestamp":1648968417786},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2018,2,7]],"date-time":"2018-02-07T00:00:00Z","timestamp":1517961600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s00453-018-0412-y","type":"journal-article","created":{"date-parts":[[2018,2,7]],"date-time":"2018-02-07T14:19:48Z","timestamp":1518013188000},"page":"3704-3727","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications"],"prefix":"10.1007","volume":"80","author":[{"given":"Ali","family":"Dehghan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad-Reza","family":"Sadeghi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arash","family":"Ahadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,7]]},"reference":[{"key":"412_CR1","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s00373-010-0946-5","volume":"26","author":"S Akbari","year":"2010","unstructured":"Akbari, S., Daemi, A., Hatami, O., Javanmard, A., Mehrabian, A.: Zero-sum flows in regular graphs. Gr. Comb. 26, 603\u2013615 (2010)","journal-title":"Gr. Comb."},{"issue":"11\u201312","key":"412_CR2","doi-asserted-by":"publisher","first-page":"3047","DOI":"10.1016\/j.laa.2009.01.027","volume":"430","author":"S Akbari","year":"2009","unstructured":"Akbari, S., Ghareghani, N., Khosrovshahi, G.B., Mahmoody, A.: On zero-sum 6-flows of graphs. Linear Algebra Appl. 430(11\u201312), 3047\u20133052 (2009)","journal-title":"Linear Algebra Appl."},{"key":"412_CR3","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s00454-009-9171-5","volume":"42","author":"N Alon","year":"2009","unstructured":"Alon, N., Berke, R., Buchin, K., Buchin, M., Csorba, P., Shannigrahi, S., Speckmann, B., Zumstein, P.: Polychromatic colorings of plane graphs. Discrete Comput. Geom. 42, 421\u2013442 (2009)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"412_CR4","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF01864169","volume":"4","author":"N Alon","year":"1988","unstructured":"Alon, N., Bregman, Z.: Every $$8$$ 8 -uniform $$8$$ 8 -regular hypergraph is $$2$$ 2 -colorable. Gr. Comb. 4(4), 303\u2013305 (1988)","journal-title":"Gr. Comb."},{"issue":"8","key":"412_CR5","doi-asserted-by":"publisher","first-page":"1236","DOI":"10.1016\/j.dam.2005.10.014","volume":"154","author":"C Bazgan","year":"2006","unstructured":"Bazgan, C., Tuza, Z., Vanderpooten, D.: The satisfactory partition problem. Discrete Appl. Math. 154(8), 1236\u20131245 (2006)","journal-title":"Discrete Appl. Math."},{"key":"412_CR6","volume-title":"Introduction to Graph Theory","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Introduction to Graph Theory. American Eisevier Publ. Co., New York (1976)"},{"key":"412_CR7","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0095-8956(83)90041-2","volume":"34","author":"A Bouchet","year":"1983","unstructured":"Bouchet, A.: Nowhere-zero integral flows on a bidirected graph. J. Comb. Theory Ser. B 34, 279\u2013292 (1983)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"412_CR8","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.ipl.2014.09.024","volume":"115","author":"A Brandst\u00e4dt","year":"2015","unstructured":"Brandst\u00e4dt, A., Fivcur, P., Leitert, A., Milaniv c, M.: Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs. Inf. Process. Lett. 115(2), 256\u2013262 (2015)","journal-title":"Inf. Process. Lett."},{"key":"412_CR9","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-642-35261-4_30","volume-title":"Algorithms and Computation","author":"Andreas Brandst\u00e4dt","year":"2012","unstructured":"Brandst\u00e4dt, A., Leitert, A., Rautenbach, D.: Efficient dominating and edge dominating sets for graphs and hypergraphs. In: Chao, K.M., Hsu, T., Lee, D.T. (eds.) Algorithms and Computation. ISAAC 2012. Lecture Notes in Computer Science, vol. 7676, pp. 267\u2013277. Springer, Berlin, Heidelberg (2012)"},{"key":"412_CR10","first-page":"247","volume":"73","author":"N Calkin","year":"2004","unstructured":"Calkin, N., Dankelmann, P.: The domatic number of regular graphs. Ars Comb. 73, 247\u2013255 (2004)","journal-title":"Ars Comb."},{"key":"412_CR11","first-page":"86","volume-title":"Lecture Notes in Computer Science","author":"David Cattan\u00e9o","year":"2014","unstructured":"Cattan\u00e9o, D., Perdrix, S.: The parameterized complexity of domination-type problems and application to linear codes. In: Gopal, T.V., Agrawal, M., Li, A., Cooper, S.B. (eds.) Theory and Applications of Models of Computation. TAMC 2014. Lecture Notes in Computer Science, vol. 8402, pp. 86\u2013103. Springer, Cham (2014)"},{"issue":"3","key":"412_CR12","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s00373-012-1142-6","volume":"29","author":"J-O Choi","year":"2013","unstructured":"Choi, J.-O., Georges, J.P., Mauro, D.: On zero-sum $$\\mathbb{Z}_k$$ Z k -magic labelings of 3-regular graphs. Gr. Comb. 29(3), 387\u2013398 (2013)","journal-title":"Gr. Comb."},{"issue":"9","key":"412_CR13","doi-asserted-by":"publisher","first-page":"2938","DOI":"10.1016\/j.disc.2012.05.022","volume":"312","author":"J-O Choi","year":"2012","unstructured":"Choi, J.-O., Georges, J.P., Mauro, D.: Relating edge-coverings to the classification of Z2-magic graphs. Discrete Math. 312(9), 2938\u20132945 (2012)","journal-title":"Discrete Math."},{"key":"412_CR14","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1002\/net.3230030406","volume":"3","author":"FG Commoner","year":"1973","unstructured":"Commoner, F.G.: A sufficient condition for a matrix to be totally unimodular. Networks 3, 351\u2013365 (1973)","journal-title":"Networks"},{"issue":"24","key":"412_CR15","first-page":"141","volume":"9","author":"DM Cvetkovi\u0107","year":"1972","unstructured":"Cvetkovi\u0107, D.M., Gutman, I.M.: The algebraic multiplicity of the number zero in the spectrum of a bipartite graph. Mat. Vesn. 9(24), 141\u2013150 (1972)","journal-title":"Mat. Vesn."},{"issue":"3","key":"412_CR16","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/s10878-015-9894-6","volume":"32","author":"A Dehghan","year":"2016","unstructured":"Dehghan, A.: On strongly planar not-all-equal 3SAT. J. Comb. Optim. 32(3), 721\u2013724 (2016)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"412_CR17","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.ipl.2014.10.004","volume":"115","author":"A Dehghan","year":"2015","unstructured":"Dehghan, A., Sadeghi, M.-R.: The complexity of the zero-sum 3-flows. Inf. Process. Lett. 115(2), 316\u2013320 (2015)","journal-title":"Inf. Process. Lett."},{"issue":"11","key":"412_CR18","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1016\/j.ipl.2016.06.010","volume":"116","author":"A Dehghan","year":"2016","unstructured":"Dehghan, A., Sadeghi, M.-R.: On the algorithmic complexity of zero-sum edge-coloring. Inf. Process. Lett. 116(11), 660\u2013667 (2016)","journal-title":"Inf. Process. Lett."},{"key":"412_CR19","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2013.05.027","volume":"495","author":"A Dehghan","year":"2013","unstructured":"Dehghan, A., Sadeghi, M.-R., Ahadi, A.: Algorithmic complexity of proper labeling problems. Theor. Comput. Sci. 495, 25\u201336 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"412_CR20","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.ipl.2010.11.010","volume":"111","author":"T Feder","year":"2011","unstructured":"Feder, T., Subi, C.: Maximum gap labelings of graphs. Inf. Process. Lett. 111(4), 169\u2013173 (2011)","journal-title":"Inf. Process. Lett."},{"key":"412_CR21","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1137\/S0097539700380754","volume":"32","author":"U Feige","year":"2002","unstructured":"Feige, U., Halld\u00f3rsson, M.M., Kortsarz, G., Srinivasan, A.: Approximating the domatic number. SIAM J. Comput. 32, 72\u2013195 (2002)","journal-title":"SIAM J. Comput."},{"key":"412_CR22","volume-title":"Computers and Intractability: A Guide to the Theory of $$NP$$","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of $$NP$$ NP -Completeness. W. H. Freeman, San Francisco (1979)"},{"key":"412_CR23","unstructured":"Gerber, M.U., Kobler, D.: Algorithmic approach to the satisfactory graph partitioning problem. European J. Oper. Res. 125(2), 283\u2013291 (2000). Combinatorial optimization (Copenhagen, 1998)"},{"issue":"1\u20133","key":"412_CR24","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1016\/S0304-3975(02)00725-9","volume":"299","author":"MU Gerber","year":"2003","unstructured":"Gerber, M.U., Kobler, D.: Algorithms for vertex-partitioning problems on graphs with fixed clique-width. Theor. Comput. Sci. 299(1\u20133), 719\u2013734 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"412_CR25","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1016\/j.dam.2010.11.012","volume":"160","author":"PA Golovach","year":"2012","unstructured":"Golovach, P.A., Kratochv\u00edl, J., Such\u00fd, O.: Parameterized complexity of generalized domination problems. Discrete Appl. Math. 160(6), 780\u2013792 (2012)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"412_CR26","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0012-365X(01)00370-3","volume":"254","author":"Fumio Hazama","year":"2002","unstructured":"Hazama, Fumio: On the kernels of the incidence matrices of graphs. Discrete Math. 254(1), 165\u2013174 (2002)","journal-title":"Discrete Math."},{"key":"412_CR27","first-page":"128","volume":"5","author":"P Heggernes","year":"1998","unstructured":"Heggernes, P., Telle, J.A.: Partitioning graphs into generalized dominating sets. Nord. J. Comput. 5, 128\u2013142 (1998)","journal-title":"Nord. J. Comput."},{"issue":"2","key":"412_CR28","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1002\/jgt.21793","volume":"78","author":"E M\u00e1\u010dajov\u00e1","year":"2015","unstructured":"M\u00e1\u010dajov\u00e1, E., Rollov\u00e1, E.: Nowhere-zero flows on signed complete and complete bipartite graphs. J. Gr. Theory 78(2), 108\u2013130 (2015)","journal-title":"J. Gr. Theory"},{"issue":"93","key":"412_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2298\/PIM0693001M","volume":"79","author":"MC Marino","year":"2006","unstructured":"Marino, M.C., Sciriha, I., Simi\u0107, S.K., To\u0161i\u0107, D.V.: More about singular line graphs of trees. Publ. Inst. Math. Nouv. S\u00e9r. 79(93), 1\u201312 (2006)","journal-title":"Publ. Inst. Math. Nouv. S\u00e9r."},{"issue":"4","key":"412_CR30","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/s00454-001-0047-6","volume":"26","author":"C Moore","year":"2001","unstructured":"Moore, C., Robson, J.M.: Hard tiling problems with simple tiles. Discrete Comput. Geom. 26(4), 573\u2013590 (2001)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"412_CR31","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/49097.49099","volume":"19","author":"BM Moret","year":"1988","unstructured":"Moret, B.M.: Planar NAE3SAT is in P. SIGACT News 19(2), 51\u201354 (1988)","journal-title":"SIGACT News"},{"issue":"2","key":"412_CR32","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1346330.1346336","volume":"55","author":"W Mulzer","year":"2008","unstructured":"Mulzer, W., Rote, G.: Minimum-weight triangulation is NP-hard. J. ACM 55(2), 11 (2008)","journal-title":"J. ACM"},{"issue":"1","key":"412_CR33","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.laa.2007.06.017","volume":"427","author":"M Nath","year":"2007","unstructured":"Nath, M., Sarma, B.K.: On the null-spaces of acyclic and unicyclic singular graphs. Linear Algebra Appl. 427(1), 42\u201354 (2007)","journal-title":"Linear Algebra Appl."},{"key":"412_CR34","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","doi-asserted-by":"publisher","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York (1988)"},{"issue":"1","key":"412_CR35","first-page":"45","volume":"2","author":"JW Sander","year":"2005","unstructured":"Sander, J.W., Sander, T.: On simply structured bases of tree kernels. AKCE J. Gr. Comb. 2(1), 45\u201356 (2005)","journal-title":"AKCE J. Gr. Comb."},{"issue":"12","key":"412_CR36","doi-asserted-by":"publisher","first-page":"3132","DOI":"10.1016\/j.laa.2010.01.012","volume":"432","author":"JW Sander","year":"2010","unstructured":"Sander, J.W., Sander, T.: On the eigenvalues of distance powers of circuits. Linear Algebra Appl. 432(12), 3132\u20133140 (2010)","journal-title":"Linear Algebra Appl."},{"key":"412_CR37","doi-asserted-by":"crossref","unstructured":"Sander, T.: On certain eigenspaces of cographs. Electron. J. Comb. 15(1):Research Paper 140, 8, (2008)","DOI":"10.37236\/864"},{"key":"412_CR38","doi-asserted-by":"crossref","unstructured":"Sander, T.: Sudoku graphs are integral. Electron. J. Comb. 16(1):Note 25, 7 (2009)","DOI":"10.37236\/263"},{"issue":"1","key":"412_CR39","first-page":"61","volume":"4","author":"T Sander","year":"2007","unstructured":"Sander, T., Sander, J.W.: On simply structured kernel bases of unicyclic graphs. AKCE Int. J. Gr. Comb. 4(1), 61\u201382 (2007)","journal-title":"AKCE Int. J. Gr. Comb."},{"issue":"1","key":"412_CR40","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.laa.2008.07.015","volume":"430","author":"T Sander","year":"2009","unstructured":"Sander, T., Sander, J.W.: Tree decomposition by eigenvectors. Linear Algebra Appl. 430(1), 133\u2013144 (2009)","journal-title":"Linear Algebra Appl."},{"key":"412_CR41","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.ffa.2014.09.001","volume":"31","author":"G Sarkis","year":"2015","unstructured":"Sarkis, G., Shahriari, S.: Zero-sum flows of the linear lattice. Finite Fields Appl. 31, 108\u2013120 (2015)","journal-title":"Finite Fields Appl."},{"key":"412_CR42","unstructured":"Sciriha, I.: The two classes of singular line graphs of trees. Rend. Sem. Mat. Messina Ser. II, 5(21)(suppl.):167\u2013180 (2000), 1999. 5th Workshop on Combinatorics (Messina, 1999)"},{"issue":"10","key":"412_CR43","doi-asserted-by":"publisher","first-page":"3102","DOI":"10.1016\/j.disc.2008.08.011","volume":"309","author":"K Shafique","year":"2009","unstructured":"Shafique, K., Dutton, R.D.: Partitioning a graph into alliance free sets. Discrete Math. 309(10), 3102\u20133105 (2009)","journal-title":"Discrete Math."},{"issue":"1","key":"412_CR44","first-page":"157","volume":"1","author":"JA Telle","year":"1994","unstructured":"Telle, J.A.: Complexity of domination-type problems in graphs. Nord. J. Comput. 1(1), 157\u2013171 (1994)","journal-title":"Nord. J. Comput."},{"key":"412_CR45","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.jctb.2014.02.012","volume":"108","author":"C Thomassen","year":"2014","unstructured":"Thomassen, C.: Group flow, complex flow, unit vector flow, and the $$(2+\\epsilon )$$ ( 2 + \u03f5 ) -flow conjecture. J. Comb. Theory Ser. B 108, 81\u201391 (2014)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"412_CR46","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1090\/S0894-0347-1992-1135027-1","volume":"5","author":"Carsten Thomassen","year":"1992","unstructured":"Thomassen, Carsten: The even cycle problem for directed graphs. J. Am. Math. Soc. 5(2), 217\u2013229 (1992)","journal-title":"J. Am. Math. Soc."},{"key":"412_CR47","doi-asserted-by":"publisher","first-page":"80","DOI":"10.4153\/CJM-1954-010-9","volume":"6","author":"WT Tutte","year":"1954","unstructured":"Tutte, W.T.: A contribution to the theory of chromatic polynomials. Can. J. Math. 6, 80\u201391 (1954)","journal-title":"Can. J. Math."},{"issue":"9","key":"412_CR48","doi-asserted-by":"publisher","first-page":"3513","DOI":"10.1080\/00927879508825412","volume":"23","author":"RH Villarreal","year":"1995","unstructured":"Villarreal, R.H.: Rees algebras of edge ideals. Commun. Algebra 23(9), 3513\u20133524 (1995)","journal-title":"Commun. Algebra"},{"key":"412_CR49","doi-asserted-by":"crossref","unstructured":"Wang, T.-M., Hu, S.-W., Zhang, G.-H.: Zero-sum flow numbers of triangular grids. In: Frontiers in Algorithmics, pp. 264\u2013275. Springer (2014)","DOI":"10.1007\/978-3-319-08016-1_24"},{"key":"412_CR50","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-642-38756-2_34","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"Tao-Ming Wang","year":"2013","unstructured":"Wang, T.-M., Zhang, G.-H.: Zero-sum flow numbers of hexagonal grids. In: Fellows, M., Tan, X., Zhu, B. (eds.) Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science, vol. 7924, pp. 339\u2013349. Springer, Berlin, Heidelberg (2013)"},{"key":"412_CR51","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-642-21204-8_20","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"Tao-Ming Wang","year":"2011","unstructured":"Wang, T.-M., Hu, S.-W.: Constant sum flows in regular graphs. In: Atallah, M., Li, X.Y., Zhu, B. (eds.) Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science, vol. 6681, pp. 168\u2013175. Springer, Berlin, Heidelberg (2011)"},{"key":"412_CR52","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-642-29700-7_25","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"Tao-Ming Wang","year":"2012","unstructured":"Wang, T.-M., Hu, S.-W.: Zero-sum flow numbers of regular graphs. In: Lecture Notes in Computer Science, vol. 7285, pp. 269\u2013278 (2012)"},{"issue":"5","key":"412_CR53","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1016\/j.disc.2007.11.055","volume":"309","author":"X Wang","year":"2009","unstructured":"Wang, X., Zhang, C.-Q., Zhang, T.: Nowhere-zero 4-flow in almost petersen-minor free graphs. Discrete Math. 309(5), 1025\u20131032 (2009)","journal-title":"Discrete Math."},{"issue":"4","key":"412_CR54","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/s10114-014-2028-8","volume":"30","author":"EL Wei","year":"2014","unstructured":"Wei, E.L., Tang, W.L., Ye, D.: Nowhere-zero 15-flow in 3-edge-connected bidirected graphs. Acta Math. Sin. (Engl. Ser.) 30(4), 649\u2013660 (2014)","journal-title":"Acta Math. Sin. (Engl. Ser.)"},{"key":"412_CR55","volume-title":"Introduction to Graph Theory","author":"Douglas B West","year":"1996","unstructured":"West, Douglas B.: Introduction to Graph Theory. Prentice Hall Inc., Upper Saddle River (1996)"},{"issue":"17","key":"412_CR56","doi-asserted-by":"publisher","first-page":"1988","DOI":"10.1016\/j.disc.2011.05.011","volume":"311","author":"J Yan","year":"2011","unstructured":"Yan, J.: Nowhere-zero 3-flows and $$\\text{ z }_3$$ z 3 -connectivity of a family of graphs. Discrete Math. 311(17), 1988\u20131994 (2011)","journal-title":"Discrete Math."},{"key":"412_CR57","first-page":"7","volume":"39","author":"B Zelinka","year":"1989","unstructured":"Zelinka, B.: Total domatic number and degrees of vertices of a graph. Math. Slov. 39, 7\u201311 (1989)","journal-title":"Math. Slov."},{"issue":"1\u20133","key":"412_CR58","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0012-365X(95)00047-Z","volume":"154","author":"CQ Zhang","year":"1996","unstructured":"Zhang, C.Q.: Nowhere-zero 4-flows and cycle double covers. Discrete Math. 154(1\u20133), 245\u2013253 (1996)","journal-title":"Discrete Math."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-018-0412-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0412-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0412-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,27]],"date-time":"2020-10-27T20:45:02Z","timestamp":1603831502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-018-0412-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,7]]},"references-count":58,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["412"],"URL":"https:\/\/doi.org\/10.1007\/s00453-018-0412-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,7]]},"assertion":[{"value":"5 August 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}