{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T01:27:30Z","timestamp":1791077250643,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540404934","type":"print"},{"value":"9783540450610","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45061-0_63","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:54:04Z","timestamp":1184601244000},"page":"802-816","source":"Crossref","is-referenced-by-count":10,"title":["There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them)"],"prefix":"10.1007","author":[{"given":"Luisa","family":"Gargano","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mikael","family":"Hammar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"63_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1007\/BFb0028567","volume-title":"Proc. 15th Annual Symposium on Theoretical Aspects of Computer Science","author":"C. Bazgan","year":"1998","unstructured":"C. Bazgan, M. Shanta, Z. Tuza, \u201cOn the Approximabilityof Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs\u201d, Proc. 15th Annual Symposium on Theoretical Aspects of Computer Science, LNCS, Vol. 1373, 276\u2013286, Springer, (1998)."},{"key":"63_CR2","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"C. Berge. Graphs and Hypergraphs. North-Holland Publishing Company \u2014 Amsterdam and London, 1973."},{"key":"63_CR3","first-page":"473","volume":"4","author":"J. A. Bondy","year":"1969","unstructured":"J. A. Bondy. Properties of graphs with constraints on degrees. Studia Sc. Math. Hung., 4:473\u2013475, 1969.","journal-title":"Studia Sc. Math. Hung."},{"key":"63_CR4","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0095-8956(72)90020-2","volume":"12 B","author":"V. Chvatal","year":"1972","unstructured":"V. Chvatal. On hamilton ideal\u2019s. J. Comb. Theory, 12 B:163\u2013168, 1972.","journal-title":"J. Comb. Theory"},{"key":"63_CR5","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"2","author":"G. A. Dirac","year":"1952","unstructured":"G. A. Dirac. Some theorems on abstract graphs. Proc. London Mathematical Society, 2:69\u201381, 1952.","journal-title":"Proc. London Mathematical Society"},{"key":"63_CR6","doi-asserted-by":"crossref","unstructured":"T. Feder, R. Motwani, C. Subi, \u201cFinding Long Paths and Cycles in Sparse Hamiltonian Graphs\u201d, Proc. Thirty second annual ACM Symposium on Theory of Computing (STOC\u201900) Portland, Oregon, May 21\u201323, 524\u2013529, ACM Press, 2000.","DOI":"10.1145\/335305.335368"},{"key":"63_CR7","doi-asserted-by":"crossref","unstructured":"L. Gargano, P. Hell, L. Stacho, and U. Vaccaro. Spanning trees with bounded number of branch vertices. In 29-th International Colloquium on Automata, Languages, and Programming, pages 355\u2013365, 2002.","DOI":"10.1007\/3-540-45465-9_31"},{"issue":"2","key":"63_CR8","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1002\/jgt.3190150204","volume":"15","author":"R. J. Gould","year":"1991","unstructured":"R. J. Gould. Updating the Hamiltonian problem\u2014a survey. J. Graph Theory, 15(2):121\u2013157, 1991.","journal-title":"J. Graph Theory"},{"key":"63_CR9","doi-asserted-by":"crossref","unstructured":"P. Hall. On representatives of subsets. Journal of London Mathematical Society, pages 26\u201330, 1935.","DOI":"10.1112\/jlms\/s1-10.37.26"},{"key":"63_CR10","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/0095-8956(85)90077-2","volume":"38B","author":"B. Jackson","year":"1985","unstructured":"B. Jackson. Long cycles in bipartite graphs. Journal of Combinatorial Theory, 38B:118\u2013131, 1985.","journal-title":"Journal of Combinatorial Theory"},{"key":"63_CR11","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Applications","author":"R. M. Karp","year":"1972","unstructured":"R. M. Karp. Reducibilityamong combinatorial problems. In Complexity of Computer Applications, pages 85\u2013103. Plenum Press, New York, 1972."},{"key":"63_CR12","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1137\/S0097539794264585","volume":"25","author":"S. Khuller","year":"1996","unstructured":"S. Khuller, B. Raghavachari, N. Young, \u201cLow degree spanning trees of small weight\u201d, SIAM J. Comp., 25 (1996), 335\u2013368.","journal-title":"SIAM J. Comp."},{"key":"63_CR13","doi-asserted-by":"crossref","unstructured":"J. K\u00f6nemann, R. Ravi, \u201cA Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees\u201d, Proc. Thirty second annual ACM Symp. on Theory of Computing (STOC\u201900), Portland, Oregon, 537\u2013546, (2000).","DOI":"10.1145\/335305.335371"},{"key":"63_CR14","volume-title":"Optical Communication Networks","author":"B. Mukherjee","year":"1997","unstructured":"B. Mukherjee, Optical Communication Networks, McGraw-Hill, New York, 1997."},{"key":"63_CR15","first-page":"225","volume":"7","author":"L. Posa","year":"1962","unstructured":"L. Posa. A theorem concerning hamilton lines. Magyar Tud. Akad. Mat. Kutato Int. K\u00f6zl., 7:225\u2013226, 1962.","journal-title":"Magyar Tud. Akad. Mat. Kutato Int. K\u00f6zl."},{"key":"63_CR16","unstructured":"T. E. Sterne, and K. Bala, MultiWavelength Optical Networks, Addison-Wesley, (1999)."},{"key":"63_CR17","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF02995957","volume":"43","author":"S. Win","year":"1975","unstructured":"S. Win, \u201cExistenz von Ger\u00fcsten mit vorgeschriebenem Maximalgrad in Graphen\u201d, Abh. Mat. Sem. Univ. Hamburg, 43: 263\u2013267, 1975.","journal-title":"Abh. Mat. Sem. Univ. Hamburg"},{"key":"63_CR18","first-page":"1781","volume":"3","author":"X. Zhang","year":"2000","unstructured":"X. Zhang, J. Wei, and C. Qiao Constrained Multicast Routing in WDM Networks with Sparse Light Splitting Proc. of IEEE INFOCOM 2000, vol. 3: 1781\u20131790, Mar. 2000.","journal-title":"Proc. of IEEE INFOCOM 2000"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45061-0_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T00:57:26Z","timestamp":1550451446000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45061-0_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404934","9783540450610"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45061-0_63","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}