{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,2]],"date-time":"2024-09-02T11:48:20Z","timestamp":1725277700045},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1995,12,1]],"date-time":"1995-12-01T00:00:00Z","timestamp":817776000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[1995,12]]},"DOI":"10.1007\/bf01787816","type":"journal-article","created":{"date-parts":[[2005,6,20]],"date-time":"2005-06-20T19:06:29Z","timestamp":1119294389000},"page":"367-378","source":"Crossref","is-referenced-by-count":3,"title":["Minimum degree, independence number and regular factors"],"prefix":"10.1007","volume":"11","author":[{"given":"Thomas","family":"Niessen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01787816_CR1","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/jgt.3190180304","volume":"18","author":"D. Bauer","year":"1994","unstructured":"Bauer, D., Schmeichel, E.: Toughness, minimum degree and the existence of 2-factors. J. Graph Theory.18, 241\u2013256 (1994)","journal-title":"J. Graph Theory."},{"key":"BF01787816_CR2","doi-asserted-by":"crossref","unstructured":"Bauer, D., Broersma, H.J., van den Heuvel, J., Veldman, H.J.: Long cycles in graphs with prescribed toughness and minimum degree. Discrete Math. (to be published)","DOI":"10.1016\/0012-365X(93)E0204-H"},{"key":"BF01787816_CR3","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1515\/crll.1950.188.228","volume":"188","author":"H.-B. Belck","year":"1950","unstructured":"Belck, H.-B.: Regul\u00e4re Faktoren von Graphen. J. Reine Angew. Math.188, 228\u2013252 (1950)","journal-title":"J. Reine Angew. Math."},{"key":"BF01787816_CR4","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0012-365X(72)90079-9","volume":"2","author":"V. Chv\u00e1tal","year":"1972","unstructured":"Chv\u00e1tal, V., Erd\u00f6s, P.: A note on hamiltonian circuits. Discrete Math.2, 111\u2013113 (1972)","journal-title":"Discrete Math."},{"key":"BF01787816_CR5","first-page":"96","volume-title":"Recent Studies in Graph Theory","author":"Y. Egawa","year":"1989","unstructured":"Egawa, Y., Enomoto, H.: Sufficient conditions for the existence ofk-factors. In: Recent Studies in Graph Theory (V.R. Kulli, ed.), Vishwa International Publications, India (1989), 96\u2013105"},{"key":"BF01787816_CR6","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF01788075","volume":"2","author":"H. Enomoto","year":"1986","unstructured":"Enomoto, H.: Toughness and the existence ofk-factors II. Graphs and Combinatorics2, 37\u201342 (1986)","journal-title":"Graphs and Combinatorics"},{"key":"BF01787816_CR7","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1002\/jgt.3190090106","volume":"9","author":"H. Enomoto","year":"1985","unstructured":"Enomoto, H., Jackson, B., Katernis, P., Saito, A.: Toughness and the existence ofk-factors, J. Graph Theory9, 87\u201395 (1985)","journal-title":"J. Graph Theory"},{"key":"BF01787816_CR8","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01787640","volume":"7","author":"T. Iida","year":"1991","unstructured":"Iida, T., Nishimura, T.: An Ore-type condition for the existence ofk-factors in graphs. Graphs and Combinatorics7, 353\u2013361 (1991)","journal-title":"Graphs and Combinatorics"},{"key":"BF01787816_CR9","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02880991","volume":"94","author":"P. Katerinis","year":"1985","unstructured":"Katerinis, P.: Minimum degree of a graph and the existence ofk-factors. Proc. Indian Acad. Sci. (Math. Sci.)94, 123\u2013127 (1985)","journal-title":"Proc. Indian Acad. Sci. (Math. Sci.)"},{"key":"BF01787816_CR10","first-page":"185","volume":"20-B","author":"P. Katerinis","year":"1985","unstructured":"Katerinis, P.: A Chv\u00e1tal-Erd\u00f6s condition for anr-factor in a graph. Ars Combinat.20-B, 185\u2013191 (1985)","journal-title":"Ars Combinat."},{"key":"BF01787816_CR11","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1093\/qmath\/38.2.221","volume":"38","author":"P. Katerinis","year":"1987","unstructured":"Katerinis, P., Woodall, D.R.: Binding numbers and the existence ofk-factors. Quart. J. Math. Oxford (2),38, 221\u2013228 (1987)","journal-title":"Quart. J. Math. Oxford (2)"},{"key":"BF01787816_CR12","unstructured":"Lenkewitz, U., Volkmann, L.: Neighborhood and degree conditions for the existence of regular factors. Ars Combinat. (to be published)"},{"key":"BF01787816_CR13","first-page":"157","volume-title":"Studies in Pure Mathematics","author":"C.St.J.A. Nash-Williams","year":"1971","unstructured":"Nash-Williams, C.St.J.A.: Edge-disjoint hamiltonian circuits in graphs with vertices of large valency. In: Studies in Pure Mathematics (L. Mirsky, ed.) Academic Press, London, (1971), 157\u2013183"},{"key":"BF01787816_CR14","first-page":"251","volume":"34","author":"T. Niessen","year":"1992","unstructured":"Niessen, T.: Nash-Williams conditions and the existence ofk-factors. Ars Combinat.34, 251\u2013256 (1992)","journal-title":"Ars Combinat."},{"key":"BF01787816_CR15","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/jgt.3190190106","volume":"19","author":"T. Niessen","year":"1995","unstructured":"Niessen, T.: Neighborhood unions and regular factors, J. Graph Theory.19, 45\u201364 (1995)","journal-title":"J. Graph Theory."},{"key":"BF01787816_CR16","unstructured":"Niessen, T.: Complete closure and regular factors. J. Combinat. Math. Combinat. Comput. (to be published)"},{"key":"BF01787816_CR17","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1002\/jgt.3190130109","volume":"13","author":"T. Nishimura","year":"1989","unstructured":"Nishimura, T.: Independence number, connectivity, andr-factors. J. Graph Theory13, 63\u201369 (1989)","journal-title":"J. Graph Theory"},{"key":"BF01787816_CR18","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1002\/jgt.3190160205","volume":"15","author":"T. Nishimura","year":"1992","unstructured":"Nishimura, T.: A degree condition for the existence ofk-factors. J. Graph Theory15, 141\u2013151 (1992)","journal-title":"J. Graph Theory"},{"key":"BF01787816_CR19","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1002\/jgt.3190130511","volume":"13","author":"N. Tokushige","year":"1989","unstructured":"Tokushige, N.: Binding number and minimum degree fork-factors. J. Graph Theory13, 607\u2013617 (1989)","journal-title":"J. Graph Theory"},{"key":"BF01787816_CR20","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","volume":"4","author":"W.T. Tutte","year":"1947","unstructured":"Tutte, W.T.: The factorization of linear graphs. J. London Math. Soc.4, 107\u2013111 (1947)","journal-title":"J. London Math. Soc."},{"key":"BF01787816_CR21","doi-asserted-by":"crossref","first-page":"314","DOI":"10.4153\/CJM-1952-028-2","volume":"4","author":"W.T. Tutte","year":"1952","unstructured":"Tutte, W.T.: The factors of graphs. Can. J. Math.,4, 314\u2013328 (1952)","journal-title":"Can. J. Math."},{"key":"BF01787816_CR22","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0012-365X(74)90075-2","volume":"9","author":"W.T. Tutte","year":"1974","unstructured":"Tutte, W.T.: Spanning subgraphs with specified valencies. Discrete Math.9, 97\u2013108 (1974)","journal-title":"Discrete Math."},{"key":"BF01787816_CR23","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0167-5060(08)70514-4","volume":"3","author":"W.T. Tutte","year":"1978","unstructured":"Tutte, W.T.: The subgraph problem. Annals of Discrete Math.3, 289\u2013295 (1978)","journal-title":"Annals of Discrete Math."},{"key":"BF01787816_CR24","volume-title":"Coding for a multiple access channel","author":"V.K. Wei","year":"1980","unstructured":"Wei, V.K.: Coding for a multiple access channel. Ph. D. Thesis, University of Hawai, Honolulu (1980)"},{"key":"BF01787816_CR25","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1112\/jlms\/s2-41.3.385","volume":"41","author":"D.R. Woodall","year":"1990","unstructured":"Woodall, D.R.:k-factors and neighbourhoods of independent sets in graphs. J. London Math. Soc. (2)41, 385\u2013392 (1990)","journal-title":"J. London Math. Soc. (2)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01787816.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01787816\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01787816","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,3]],"date-time":"2023-05-03T13:00:35Z","timestamp":1683118835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01787816"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,12]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1995,12]]}},"alternative-id":["BF01787816"],"URL":"https:\/\/doi.org\/10.1007\/bf01787816","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,12]]}}}