{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T23:58:16Z","timestamp":1777420696096,"version":"3.51.4"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,9,27]],"date-time":"2017-09-27T00:00:00Z","timestamp":1506470400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s10878-017-0178-1","type":"journal-article","created":{"date-parts":[[2017,9,27]],"date-time":"2017-09-27T03:22:14Z","timestamp":1506482534000},"page":"373-388","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On vertex-parity edge-colorings"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8356-8827","authenticated-orcid":false,"given":"Borut","family":"Lu\u017ear","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mirko","family":"Petru\u0161evski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riste","family":"\u0160krekovski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,27]]},"reference":[{"key":"178_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-21919-1","volume-title":"Factors and factorizations of graphs: proof techniques in factor theory","author":"J Akiyama","year":"2011","unstructured":"Akiyama J, Kano M (2011) Factors and factorizations of graphs: proof techniques in factor theory. Springer, New York"},{"issue":"2","key":"178_CR2","doi-asserted-by":"crossref","first-page":"359","DOI":"10.26493\/1855-3974.957.97c","volume":"10","author":"R Atanasov","year":"2016","unstructured":"Atanasov R, Petru\u0161evski M, \u0160krekovski R (2016) Odd edge-colorability of subcubic graphs. Ars Math Contemp 10(2):359\u2013370","journal-title":"Ars Math Contemp"},{"key":"178_CR3","volume-title":"Graph theory, graduate texts in mathematics","author":"JA Bondy","year":"2008","unstructured":"Bondy JA, Murty USR (2008) Graph theory, graduate texts in mathematics, vol 244. Springer, New York"},{"key":"178_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with applications","author":"JA Bondy","year":"1976","unstructured":"Bondy JA, Murty USR (1976) Graph theory with applications. Elsevier, North-Holland"},{"key":"178_CR5","doi-asserted-by":"crossref","first-page":"2735","DOI":"10.1016\/j.disc.2012.03.036","volume":"312","author":"J Czap","year":"2012","unstructured":"Czap J, Jendrol\u2019 S, Kardo\u0161 F\u2019, Sot\u00e1k R (2012) Facial parity edge colouring of plane pseudographs. Discrete Math 312:2735\u20132740","journal-title":"Discrete Math"},{"key":"178_CR6","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0095-8956(79)90057-1","volume":"26","author":"F Jaeger","year":"1979","unstructured":"Jaeger F (1979) Flows and generalized coloring theorems in graphs. J Combin Theory Ser B 26:205\u2013216","journal-title":"J Combin Theory Ser B"},{"key":"178_CR7","doi-asserted-by":"crossref","first-page":"277","DOI":"10.26493\/1855-3974.576.895","volume":"9","author":"B Lu\u017ear","year":"2015","unstructured":"Lu\u017ear B, Petru\u0161evski M, \u0160krekovski R (2015) Odd edge coloring of graphs. Ars Math Contemp 9:277\u2013287","journal-title":"Ars Math Contemp"},{"key":"178_CR8","doi-asserted-by":"crossref","first-page":"2218","DOI":"10.1016\/j.disc.2013.05.022","volume":"313","author":"B Lu\u017ear","year":"2013","unstructured":"Lu\u017ear B, \u0160krekovski R (2013) Improved bound on facial parity edge coloring. Discrete Math 313:2218\u20132222","journal-title":"Discrete Math"},{"key":"178_CR9","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/BF01896966","volume":"23","author":"L Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz L (1972) The factorization of graphs II. Acta Math Acad Sci Hungar 23:465\u2013478","journal-title":"Acta Math Acad Sci Hungar"},{"key":"178_CR10","first-page":"7","volume":"4","author":"M Petru\u0161evski","year":"2015","unstructured":"Petru\u0161evski M (2015) A note on weak odd edge colorings of graphs. Adv Math Sci J 4:7\u201310","journal-title":"Adv Math Sci J"},{"key":"178_CR11","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22168","author":"M Petru\u0161evski","year":"2017","unstructured":"Petru\u0161evski M (2017) Odd $$4$$ 4 -edge-colorability of graphs. J Graph Theory. doi: 10.1002\/jgt.22168","journal-title":"J Graph Theory"},{"key":"178_CR12","first-page":"583","volume":"60","author":"L Pyber","year":"1991","unstructured":"Pyber L (1991) Covering the edges of a graph by..., sets, graphs and numbers. Colloq Math Soc J\u00e1nos Bolyai 60:583\u2013610","journal-title":"Colloq Math Soc J\u00e1nos Bolyai"},{"key":"178_CR13","unstructured":"Schrijver A (2003) Combinatorial optimization. Polyhedra and efficiency, Vol A: Algorithms and combinatorics. Springer, Berlin"},{"key":"178_CR14","first-page":"342","volume-title":"Graph theory and related topics","author":"PD Seymour","year":"1979","unstructured":"Seymour PD (1979) Sums of circuits. In: Bondy A, Murty USR (eds) Graph theory and related topics. Academic Press, New York, pp 342\u2013355"},{"key":"178_CR15","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1016\/j.jctb.2012.03.002","volume":"102","author":"J Shu","year":"2012","unstructured":"Shu J, Zhang C-Q, Zhang T (2012) Flows and parity subgraphs of graphs with large odd-edge-connectivity. J Combin Theory Ser B 102:839\u2013851","journal-title":"J Combin Theory Ser B"},{"key":"178_CR16","unstructured":"Szab\u00f3 J (2006) Graph packings and the degree prescribed subgraph problem, E\u00f6tv\u00f6s Lor\u00e1nd University. Doctoral thesis"},{"key":"178_CR17","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1017\/S0004972700042660","volume":"8","author":"G Szekeres","year":"1973","unstructured":"Szekeres G (1973) Polyhedral decompositions of cubic graphs. Bull Austral Math Soc 8:367\u2013387","journal-title":"Bull Austral Math Soc"},{"key":"178_CR18","volume-title":"Introduction to graph theory","author":"D\u00a0B West","year":"2001","unstructured":"West D\u00a0B (2001) Introduction to graph theory. Pearson Education, London"},{"key":"178_CR19","volume-title":"Graph factors and matching extensions","author":"Q\u00a0R Yu","year":"2009","unstructured":"Yu Q\u00a0R, Liu G (2009) Graph factors and matching extensions. Springer, Berlin"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0178-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0178-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0178-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T20:36:23Z","timestamp":1570134983000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0178-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,27]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["178"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0178-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,27]]}}}