{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T13:56:03Z","timestamp":1780408563092,"version":"3.54.1"},"reference-count":166,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":7886,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1985,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A degree factor of a graph is either an <jats:italic>r<\/jats:italic>\u2010factor (regular of degree <jats:italic>r<\/jats:italic>) or an [m, n]\u2010factor (with each degree between <jats:italic>m<\/jats:italic> and <jats:italic>n<\/jats:italic>). In a component factor, each component is a prescribed graph. Both kinds of factors are surveyed, and also corresponding factorizations.<\/jats:p>","DOI":"10.1002\/jgt.3190090103","type":"journal-article","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T07:53:04Z","timestamp":1180425184000},"page":"1-42","source":"Crossref","is-referenced-by-count":99,"title":["Factors and factorizations of graphs\u2014a survey"],"prefix":"10.1002","volume":"9","author":[{"given":"Jin","family":"Akiyama","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mikio","family":"Kano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2006,10,3]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"97","article-title":"On a {1, 2}\u2010factor of a graph","volume":"16","author":"Akiyama J.","year":"1980","journal-title":"TRU Math."},{"key":"e_1_2_1_3_2","unstructured":"J.Akiyama Factorization and linear arboricity of graphs. Doctor of Science thesis Science University of Tokyo (1982)."},{"key":"e_1_2_1_4_2","unstructured":"J.AkiyamaandK.Ando A few comments onP3\u2010factors in a graph.Abstract of the Annual Conference of Japan Math. Soc.(1982) (in Japanese)."},{"key":"e_1_2_1_5_2","author":"Akiyama J.","journal-title":"On the size of graphs with complete\u2010factors"},{"key":"e_1_2_1_6_2","series-title":"Proc. First Colorado Sympo. on Graph Theory","volume-title":"Path factors of a graph. Graphs and Applications","author":"Akiyama J.","year":"1984"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190090110"},{"key":"e_1_2_1_8_2","first-page":"461","article-title":"Covers and joins of the vertices of a graph by edges","volume":"14","author":"Akopjan G. C.","year":"1974","journal-title":"Z. Vycisl. Mat. Fiz."},{"key":"e_1_2_1_8_3","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(74)90050-0"},{"issue":"100","key":"e_1_2_1_9_2","doi-asserted-by":"crossref","first-page":"79","DOI":"10.21136\/CMJ.1975.101296","article-title":"The existence of 2\u2010factors in squares of graphs","volume":"25","author":"Alavi Y.","year":"1975","journal-title":"Czech. Math. J."},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190060408"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(82)90048-6"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02582935"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(71)90041-4"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190090109"},{"key":"e_1_2_1_15_2","first-page":"429","article-title":"Every planar map is 4\u2010colorable, 1 & 2","volume":"21","author":"Appel K.","year":"1979","journal-title":"Illinois J. Math."},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01214296"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1137\/1012106"},{"key":"e_1_2_1_18_2","volume-title":"Graphs & Digraphs","author":"Behzad M.","year":"1979"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(67)80029-2"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1515\/crll.1950.188.228"},{"key":"e_1_2_1_21_2","first-page":"258","article-title":"Sur le couplage maximum d'un graphe","volume":"247","author":"Berge C.","year":"1958","journal-title":"C. R. Acad. Sci. Paris"},{"key":"e_1_2_1_22_2","unstructured":"C.Berge Th\u00e9orie des Graphes et ses Applications (1958)."},{"key":"e_1_2_1_23_2","unstructured":"C.Berge Graphes et Hypergraphes Dunod (1970)."},{"key":"e_1_2_1_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70493-X"},{"key":"e_1_2_1_25_2","first-page":"165","article-title":"On the existence of subgraphs with degree constraints","author":"Berge C.","year":"1978","journal-title":"Proc. Konink. Nederl. Adad. Wet., Amsterdam"},{"key":"e_1_2_1_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(84)90030-X"},{"key":"e_1_2_1_27_2","volume-title":"Graph Theory 1736\u20131936","author":"Biggs N. L.","year":"1976"},{"key":"e_1_2_1_28_2","volume-title":"Extremal Graph Theory","author":"Bollob\u00e1s B.","year":"1978"},{"key":"e_1_2_1_29_2","unstructured":"B.Bollob\u00e1s The number of 1\u2010factors in 2k\u2010connected graphs.J. Combin. Theory B."},{"key":"e_1_2_1_30_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-9967-7"},{"key":"e_1_2_1_31_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100052233"},{"key":"e_1_2_1_32_2","unstructured":"B.Bollob\u00e1s D.GoldsmithandD. R.Woodall Indestructive deletions of edges from graphs."},{"key":"e_1_2_1_33_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0070365"},{"key":"e_1_2_1_34_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190090107"},{"key":"e_1_2_1_35_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"e_1_2_1_36_2","doi-asserted-by":"publisher","DOI":"10.2307\/1967667"},{"key":"e_1_2_1_37_2","author":"Chartrand G.","journal-title":"Near 1\u2010factors in graphs"},{"key":"e_1_2_1_38_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02018371"},{"key":"e_1_2_1_39_2","doi-asserted-by":"publisher","DOI":"10.1016\/1385-7258(73)90007-3"},{"key":"e_1_2_1_40_2","doi-asserted-by":"publisher","DOI":"10.1137\/0120054"},{"key":"e_1_2_1_41_2","first-page":"41","article-title":"Factors of graphs and degree sequences","volume":"9","author":"Chungphaisan V.","year":"1976","journal-title":"Nanta Math."},{"key":"e_1_2_1_42_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(73)90138-6"},{"key":"e_1_2_1_43_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01895727"},{"key":"e_1_2_1_44_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(80)90002-3"},{"key":"e_1_2_1_45_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(77)90079-6"},{"key":"e_1_2_1_46_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1965-045-4"},{"key":"e_1_2_1_47_2","doi-asserted-by":"publisher","DOI":"10.6028\/jres.069B.013"},{"key":"e_1_2_1_48_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579233"},{"key":"e_1_2_1_49_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190090106"},{"key":"e_1_2_1_50_2","series-title":"Proc. of the first Colorado Symp. on Graph Theory","volume-title":"Semi\u2010regular factorization of regular graphs. Graphs and Applications","author":"Era H.","year":"1984"},{"key":"e_1_2_1_51_2","first-page":"7","article-title":"A note on semiregular factorizations of regular graphs","volume":"19","author":"Era H.","year":"1984","journal-title":"Proc. Fac. Sci., Tokai Univ."},{"key":"e_1_2_1_52_2","first-page":"181","article-title":"On the minimum number of vertices representing the edges of a graph","volume":"6","author":"Erd\u00f6s P.","year":"1961","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"e_1_2_1_53_2","first-page":"56","article-title":"Une d\u00e9monstration du th\u00e9or\u00e8me de Petersen","volume":"36","author":"Errera A.","year":"1922","journal-title":"Mathesis"},{"key":"e_1_2_1_54_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRev.124.1664"},{"key":"e_1_2_1_55_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(70)80006-0"},{"key":"e_1_2_1_56_2","first-page":"491","article-title":"A proof of Petersen's theorem","volume":"27","author":"Frink O.","year":"1925","journal-title":"Ann. Math. (2)"},{"key":"e_1_2_1_57_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1965-016-2"},{"key":"e_1_2_1_58_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02022560"},{"key":"e_1_2_1_59_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02066678"},{"key":"e_1_2_1_60_2","first-page":"135","article-title":"Neuer Beweis eines Tutte'schen Satzes","volume":"8","author":"Gallai T.","year":"1963","journal-title":"Mat. Kut. Int. K\u00f6zl."},{"key":"e_1_2_1_61_2","first-page":"373","article-title":"Maximale System unabhangiger Kanten","volume":"9","author":"Gallai T.","year":"1964","journal-title":"Math. Kut. Int. Kozl."},{"key":"e_1_2_1_62_2","volume-title":"Computers and Intractability (A Guide to the Theory of NP\u2010Completeness)","author":"Garey M. R.","year":"1979"},{"key":"e_1_2_1_63_2","author":"Glover F.","journal-title":"A simple criterion for a graph to have a 1\u2010factor"},{"key":"e_1_2_1_64_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(75)90085-0"},{"key":"e_1_2_1_65_2","first-page":"492","volume-title":"Int. Conf. on Combinatorial Structures and Their Applications, Calgary (1969)","author":"Gr\u00fcnbaum B.","year":"1970"},{"key":"e_1_2_1_66_2","series-title":"Colloq. Math. Soc. J. Bolyai 4","first-page":"601","volume-title":"Combinatorial Theory and its Applications","author":"Hajnal A.","year":"1970"},{"key":"e_1_2_1_67_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1948-09098-X"},{"key":"e_1_2_1_68_2","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-10.37.26"},{"key":"e_1_2_1_69_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100040342"},{"key":"e_1_2_1_70_2","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364"},{"key":"e_1_2_1_71_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(84)90150-X"},{"key":"e_1_2_1_72_2","first-page":"151","article-title":"Gr\u00e0fok 1\u2010faktorairol","volume":"8","author":"Hetyei G.","year":"1964","journal-title":"P\u00e9csi Tan. Foisk. Kozl."},{"key":"e_1_2_1_73_2","first-page":"351","article-title":"2 \u00d7 1\u2010es t\u00e9glalapokkal lefedhet\u00f6 idomokrol","volume":"8","author":"Hetyei G.","year":"1964","journal-title":"P\u00e9sci Tan. F\u00f6isk. K\u00f6zl."},{"key":"e_1_2_1_74_2","first-page":"66","article-title":"On 1\u2010factorability and edge\u2010colorability of cartesian products of graphs","volume":"29","author":"Himelwright P. E.","year":"1974","journal-title":"Elem. Math."},{"key":"e_1_2_1_75_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190060108"},{"key":"e_1_2_1_76_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(80)90042-8"},{"key":"e_1_2_1_77_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(74)90146-0"},{"key":"e_1_2_1_78_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90274-1"},{"key":"e_1_2_1_79_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1961-10635-6"},{"key":"e_1_2_1_80_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01360317"},{"key":"e_1_2_1_81_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190090111"},{"key":"e_1_2_1_82_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0073114"},{"key":"e_1_2_1_83_2","author":"Kano M.","journal-title":"[a, b]\u2010Factorization of a graph II"},{"key":"e_1_2_1_84_2","author":"Kano M.","journal-title":"Sufficient conditions for a graph to have factors"},{"key":"e_1_2_1_85_2","unstructured":"M.KanoandA.Saito Some results on factors.Tech. Rep.82\u201310 Dep. Inf. Sci. Tokyo Univ. (1982)."},{"key":"e_1_2_1_86_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90077-8"},{"key":"e_1_2_1_87_2","volume-title":"Graph theory and crystal physics. Graph Theory and Theoretical Physics","author":"Kasteleyn P. W.","year":"1967"},{"key":"e_1_2_1_88_2","first-page":"191","article-title":"On a problem in combinatorics","volume":"2","author":"Kirkman T.","year":"1847","journal-title":"Cambridge and Dublin Math. J."},{"key":"e_1_2_1_89_2","series-title":"Colloq. Math. Soc. J. Bolyai, 25","first-page":"273","volume-title":"Algebraic Methods in Graph Theory","author":"Kirkpatrick D. G.","year":"1981"},{"key":"e_1_2_1_90_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(73)90037-X"},{"key":"e_1_2_1_91_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01456961"},{"key":"e_1_2_1_92_2","first-page":"116","article-title":"Graphen und Matrizen","volume":"38","author":"K\u00f6nig D.","year":"1931","journal-title":"Mat. Fiz. Lapok."},{"key":"e_1_2_1_93_2","volume-title":"Theorie der endlichen und unendlichen Graphen","author":"K\u00f6nig D.","year":"1936"},{"key":"e_1_2_1_94_2","first-page":"73","article-title":"On the theory of finite graphs with a linear factor I, II, III","volume":"9","author":"Kotzig A.","year":"1959","journal-title":"Mat. Fyz. Casopis"},{"key":"e_1_2_1_95_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190030104"},{"key":"e_1_2_1_96_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(73)90068-X"},{"key":"e_1_2_1_97_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(74)90147-2"},{"key":"e_1_2_1_98_2","first-page":"257","article-title":"A note on matchings in graphs","volume":"17","author":"Las Vergnas M.","year":"1975","journal-title":"Cahiers du Centre d'Etudes de Recherche Operationelle"},{"key":"e_1_2_1_99_2","series-title":"Colloq. Keszthely, 1973","first-page":"1473","volume-title":"Infinite and Finite Sets","author":"Las Vergnas M.","year":"1975"},{"key":"e_1_2_1_100_2","first-page":"241","article-title":"An extension of Tutte's 1\u2010factors of a graph","volume":"2","author":"Las Vergnas M.","year":"1972","journal-title":"Discrete Math."},{"key":"e_1_2_1_101_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(72)90083-0"},{"key":"e_1_2_1_102_2","article-title":"Sur l'utilisation d'un pfaffien da l'etude des couplages parfaits d'un graphe","volume":"274","author":"Little C. H. C.","year":"1972","journal-title":"C. R. Acad. Sci. A\u2010B"},{"key":"e_1_2_1_103_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01889914"},{"key":"e_1_2_1_104_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(70)80033-3"},{"key":"e_1_2_1_105_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01894789"},{"key":"e_1_2_1_106_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01889914"},{"key":"e_1_2_1_107_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02276100"},{"key":"e_1_2_1_108_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02020548"},{"key":"e_1_2_1_109_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(75)90089-1"},{"key":"e_1_2_1_110_2","volume-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz L.","year":"1979"},{"key":"e_1_2_1_111_2","first-page":"1051","volume-title":"On bicritical graphs. Infinite and Finite Sets","author":"Lov\u00e1sz L.","year":"1975"},{"key":"e_1_2_1_112_2","volume-title":"The Matching Structure of Graphs","author":"Lov\u00e1sz L."},{"key":"e_1_2_1_113_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0004972700042982"},{"key":"e_1_2_1_114_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01432512"},{"key":"e_1_2_1_115_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1977-046-7"},{"key":"e_1_2_1_116_2","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-27.1.127"},{"key":"e_1_2_1_117_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190090104"},{"key":"e_1_2_1_118_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581025"},{"key":"e_1_2_1_119_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(81)90006-6"},{"key":"e_1_2_1_120_2","first-page":"257","volume-title":"Theory of Graphs","author":"Nagle J. F.","year":"1967"},{"key":"e_1_2_1_121_2","first-page":"191","volume-title":"Combinatorial Mathematics and its Applications","author":"Nash\u2010Williams C. St. J. A.","year":"1971"},{"key":"e_1_2_1_122_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190020308"},{"issue":"104","key":"e_1_2_1_123_2","doi-asserted-by":"crossref","first-page":"588","DOI":"10.21136\/CMJ.1979.101641","article-title":"On 2\u2010factors in squares of graphs","volume":"29","author":"Nebesk\u00fd L.","year":"1979","journal-title":"Czech. Math. J."},{"key":"e_1_2_1_124_2","doi-asserted-by":"crossref","first-page":"204","DOI":"10.21136\/CPM.1980.118062","article-title":"On the existence of a 3\u2010factor in the fourth power of a graph","volume":"105","author":"Nebesk\u00fd L.","year":"1980","journal-title":"Casopis Pest. Mat."},{"key":"e_1_2_1_125_2","first-page":"226","article-title":"On 1\u2010factors in the cube of a graph","volume":"106","author":"Nebesk\u00fd L.","year":"1981","journal-title":"CKasopis Pest. Mat."},{"key":"e_1_2_1_126_2","first-page":"52","article-title":"Regular factors in powers of connected graphs","volume":"106","author":"Nebesk\u00fd L.","year":"1981","journal-title":"CKasopis Pest. Mat."},{"key":"e_1_2_1_127_2","doi-asserted-by":"publisher","DOI":"10.2307\/1970010"},{"key":"e_1_2_1_127_3","doi-asserted-by":"publisher","DOI":"10.2307\/1969952"},{"key":"e_1_2_1_127_4","doi-asserted-by":"publisher","DOI":"10.2307\/1970154"},{"key":"e_1_2_1_128_2","doi-asserted-by":"publisher","DOI":"10.2307\/1992894"},{"issue":"9","key":"e_1_2_1_129_2","first-page":"321","article-title":"Conditions for subgraphs of directed graphs","volume":"37","author":"Ore O.","year":"1958","journal-title":"J. Math. Pures Appl."},{"key":"e_1_2_1_130_2","doi-asserted-by":"publisher","DOI":"10.2307\/1993450"},{"key":"e_1_2_1_131_2","doi-asserted-by":"publisher","DOI":"10.1090\/coll\/038"},{"key":"e_1_2_1_132_2","unstructured":"C.Payan Sur quelques problemes de couverture et de couplages en combinatoire Ph.D. Thesis Grenoble (1977)."},{"key":"e_1_2_1_133_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392606"},{"key":"e_1_2_1_134_2","first-page":"2967","article-title":"Sur L'utilisation d'un pfaffien dans l'etude des couplages parfaits d'un graphe","volume":"260","author":"Pla J. M.","year":"1965","journal-title":"C. R. Acad. Sci. Paris"},{"key":"e_1_2_1_135_2","article-title":"Connectivity of regular graphs and the existence of 1\u2010factors","volume":"22","author":"Plesn\u00edk J.","year":"1972","journal-title":"Math. CKasopis"},{"issue":"99","key":"e_1_2_1_136_2","doi-asserted-by":"crossref","first-page":"292","DOI":"10.21136\/CMJ.1974.101241","article-title":"Remarks on regular factors of regular graphs","volume":"24","author":"Plesnik J.","year":"1974","journal-title":"Czech. Math. J."},{"key":"e_1_2_1_137_2","article-title":"A simple proof of the perfect matching theorem","volume":"25","author":"Plesn\u00edk J.","year":"1975","journal-title":"Mat. Ckasopis Sloven. Akad. Vied"},{"key":"e_1_2_1_138_2","first-page":"63","article-title":"Remark on matchings in regular graphs","volume":"34","author":"Plesn\u00edk J.","year":"1979","journal-title":"Acta Fac. Refum Nat. Univ. Comen. Math."},{"key":"e_1_2_1_139_2","first-page":"215","article-title":"On the complexity of finding degree constrained subgraphs","volume":"40","author":"Plesn\u00edk J.","year":"1982","journal-title":"Acta Math. Univ. Comen."},{"key":"e_1_2_1_140_2","doi-asserted-by":"publisher","DOI":"10.1093\/qmath\/os-20.1.95"},{"key":"e_1_2_1_141_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(77)90157-1"},{"key":"e_1_2_1_142_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(72)90055-X"},{"key":"e_1_2_1_143_2","doi-asserted-by":"publisher","DOI":"10.1515\/crll.1859.56.326"},{"key":"e_1_2_1_144_2","first-page":"159","article-title":"New methods and results in combinatoria analysis, II","volume":"16","author":"Reny\u00ed A.","year":"1966","journal-title":"Magyar Tud. Akad. Mat. Fiz. Oszt. K\u00f6zl."},{"key":"e_1_2_1_145_2","unstructured":"A.Saito Factors of graphs Master Thesis Dept. Information Sci. Tokyo Univ. (1983)."},{"key":"e_1_2_1_146_2","first-page":"51","article-title":"Ein Beweis des Petersenschen Graphensatzes","volume":"7","author":"Sch\u00f6nberger T.","year":"1934","journal-title":"Acta Litt. Acad. Sci. Szeged"},{"key":"e_1_2_1_147_2","first-page":"137","article-title":"On an ordering of the set of vertices of a connected graph","volume":"412","author":"Sekanina M.","year":"1960","journal-title":"Publ. Sci. Univ. Brno"},{"key":"e_1_2_1_148_2","first-page":"367","volume-title":"Graph Theory and Related Topics","author":"Seymour P. D.","year":"1979"},{"key":"e_1_2_1_149_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0066457"},{"key":"e_1_2_1_150_2","doi-asserted-by":"publisher","DOI":"10.2307\/2039666"},{"key":"e_1_2_1_151_2","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s2-13.2.351"},{"key":"e_1_2_1_152_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190050415"},{"key":"e_1_2_1_153_2","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-22.2.107"},{"key":"e_1_2_1_154_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1950-005-2"},{"key":"e_1_2_1_155_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1952-028-2"},{"key":"e_1_2_1_156_2","doi-asserted-by":"publisher","DOI":"10.2307\/2031831"},{"key":"e_1_2_1_157_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1954-033-3"},{"key":"e_1_2_1_158_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(74)90075-2"},{"key":"e_1_2_1_159_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70514-4"},{"key":"e_1_2_1_160_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579180"},{"key":"e_1_2_1_161_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70840-9"},{"key":"e_1_2_1_162_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(80)80025-4"},{"key":"e_1_2_1_163_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579240"},{"key":"e_1_2_1_164_2","volume-title":"Graph Theory","author":"Tutte W. T.","year":"1984"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190090103","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190090103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T05:45:30Z","timestamp":1697867130000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190090103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,3]]},"references-count":166,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,3]]}},"alternative-id":["10.1002\/jgt.3190090103"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190090103","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,3]]}}}