{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:47:02Z","timestamp":1759063622464},"reference-count":12,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3735,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0166-218x(02)00503-6","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"421-434","source":"Crossref","is-referenced-by-count":16,"title":["Some problems on factorizations with constraints in bipartite graphs"],"prefix":"10.1016","volume":"128","author":[{"given":"Guizhen","family":"Liu","sequence":"first","affiliation":[]},{"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00503-6_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.3190090103","article-title":"Factors and factorizations of graphs\u2014a survey","volume":"9","author":"Akiyama","year":"1985","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(02)00503-6_BIB2","unstructured":"B. Alspach, K. Heinrich, G. Liu, Orthogonal factorizations of graphs, in: J.H. Diuctz, D.R. Stinson (Eds.), Contemporary Design Theory: A Collection of Surveys, Wiley, New York, 1992, pp. 13\u201337."},{"key":"10.1016\/S0166-218X(02)00503-6_BIB3","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/0196-6774(85)90022-7","article-title":"An algorithmic proof of Tutte's f-factor theorem","volume":"6","author":"Anstee","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(02)00503-6_BIB4","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0012-365X(97)00025-3","article-title":"Orthogonal matchings","volume":"179","author":"Anstee","year":"1998","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00503-6_BIB5","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0166-218X(02)00503-6_BIB6","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0012-365X(90)90387-W","article-title":"A simple existence criterion for (g,f)-factors","volume":"85","author":"Heinrich","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00503-6_BIB7","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1006\/jagm.1993.1006","article-title":"Algorithms for degree constrained graph factors of minimum deficiency","volume":"14","author":"Hell","year":"1993","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(02)00503-6_BIB8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/jgt.3190090111","article-title":"[a,b]-factorizations of a graph","volume":"9","author":"Kano","year":"1985","journal-title":"J. Graph Theory"},{"issue":"4","key":"10.1016\/S0166-218X(02)00503-6_BIB9","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1002\/1097-0037(200007)35:4<274::AID-NET6>3.0.CO;2-6","article-title":"Orthogonal (g,f)-factorizations in networks","volume":"35","author":"Lam","year":"2000","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(02)00503-6_BIB10","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BF02879045","article-title":"(g,f)-factorizations orthogonal to a subgraph in graphs","volume":"49","author":"Li","year":"1998","journal-title":"Sci. China Ser. A"},{"key":"10.1016\/S0166-218X(02)00503-6_BIB11","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0012-365X(99)00113-2","article-title":"Connected [a,b]-factors in K1,n-free graphs containing an [a,b]-factor","volume":"209","author":"Tokuda","year":"1999","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00503-6_BIB12","doi-asserted-by":"crossref","unstructured":"X. Zhou, T. Nishizeki, Edge-coloring and f-coloring for Vatious Classes of Graphs, Lecture Notes in Computer Science, Vol. 834, Springer, Berlin, 1994, pp. 199\u2013207.","DOI":"10.1007\/3-540-58325-4_182"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02005036?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02005036?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T12:30:36Z","timestamp":1584534636000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02005036"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":12,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0166218X02005036"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00503-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}