{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:25:38Z","timestamp":1725470738499},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540388753"},{"type":"electronic","value":"9783540388760"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841036_14","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T09:20:54Z","timestamp":1157966454000},"page":"124-135","source":"Crossref","is-referenced-by-count":1,"title":["Deciding Relaxed Two-Colorability\u2014A Hardness Jump"],"prefix":"10.1007","author":[{"given":"Robert","family":"Berke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tibor","family":"Szab\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0095-8956(02)00006-0","volume":"87","author":"N. Alon","year":"2003","unstructured":"Alon, N., Ding, G., Oporowski, B., Vertigan, D.: Partitioning into graphs with only small components. Journal of Combinatorial Theory (Series B)\u00a087, 231\u2013243 (2003)","journal-title":"Journal of Combinatorial Theory, (Series B)"},{"key":"14_CR2","unstructured":"Akiyama, J., Chv\u00e1tal, V.: A short proof of the linear arboricity for cubic graphs. Bull. Liber. Arts Sci. NMS\u00a02 (1981)"},{"key":"14_CR3","first-page":"405","volume":"30","author":"J. Akiyama","year":"1980","unstructured":"Akiyama, J., Exoo, G., Harary, F.: Coverings and packings in graphs II. Cyclic and acyclic invariants. Math. Slovaca\u00a030, 405\u2013417 (1980)","journal-title":"Math. Slovaca"},{"key":"14_CR4","unstructured":"Berke, R., Szab\u00f3, T.: Deciding Relaxed Two-Colorability \u2014 A Hardness Jump, full version, available at: http:\/\/www.inf.ethz.ch\/personal\/berker\/publications\/relcom-full.pdf"},{"key":"14_CR5","unstructured":"Berke, R., Szab\u00f3, T.: Relaxed Coloring of Cubic Graphs. In: Proceedings EuroComb., (extended abstract), pp. 341\u2013344 (submitted, 2005)"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1006\/jagm.2000.1132","volume":"38","author":"T.C. Biedl","year":"2001","unstructured":"Biedl, T.C., Bose, P., Demaine, E.D., Lubiw, A.: Efficient Algorithms for Petersen\u2019s Matching Theorem. Journal of Algorithms\u00a038, 110\u2013134 (2001)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"14_CR7","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1006\/jctb.2000.2018","volume":"82","author":"K. Edwards","year":"2001","unstructured":"Edwards, K., Farr, G.: Fragmentability of graphs. J. Comb. Th. Series B\u00a082(1), 30\u201337 (2001)","journal-title":"J. Comb. Th. Series B"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Havet, F., Sereni, J.-S.: Improper choosability of graphs and maximum average degree. J. Graph Theory (to appear, 2005)","DOI":"10.1002\/jgt.20155"},{"key":"14_CR9","first-page":"123","volume":"22","author":"F. Havet","year":"2005","unstructured":"Havet, F., Kang, R., Sereni, J.-S.: Improper colouring of unit disk graphs. Proceedings ICGT\u00a022, 123\u2013128 (2005)","journal-title":"Proceedings ICGT"},{"issue":"2","key":"14_CR10","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0095-8956(03)00031-5","volume":"88","author":"P. Haxell","year":"2003","unstructured":"Haxell, P., Szab\u00f3, T., Tardos, G.: Bounded size components \u2014 partitions and transversals. Journal of Combinatorial Theory (Series B)\u00a088(2), 281\u2013297 (2003)","journal-title":"Journal of Combinatorial Theory (Series B)"},{"key":"14_CR11","unstructured":"Haxell, P., Pikhurko, O., Thomason, A.: Maximum Acyclic and Fragmented Sets in Regular Graphs (submitted)"},{"key":"14_CR12","unstructured":"Hoory, S., Szeider, S.: Families of unsatisfiable k-CNF formulas with few occurrences per variable. arXiv.org e-Print archive, math. CO\/0411167 (2004)"},{"issue":"1-3","key":"14_CR13","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.tcs.2005.02.004","volume":"337","author":"S. Hoory","year":"2005","unstructured":"Hoory, S., Szeider, S.: Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable. Theoretical Computer Science\u00a0337(1-3), 347\u2013359 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"14_CR14","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1137\/0222015","volume":"22","author":"J. Kratochv\u00edl","year":"1993","unstructured":"Kratochv\u00edl, J., Savick\u00fd, P., Tuza, Z.: One more occurrence of variables makes satisfiability jump from trivial to NP-complete. SIAM J. Comput.\u00a022(1), 203\u2013210 (1993)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"14_CR15","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/BF01303516","volume":"13","author":"N. Linial","year":"1993","unstructured":"Linial, N., Saks, M.: Low diameter graph decompositions. Combinatorica\u00a013(4), 441\u2013454 (1993)","journal-title":"Combinatorica"},{"issue":"1-2","key":"14_CR16","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/S0304-3975(00)00036-0","volume":"238","author":"P. Savick\u00fd","year":"2000","unstructured":"Savick\u00fd, P., Sgall, J.: DNF tautologies with a limited number of of occurrences of every variable. Theoret. Comput. Sci.\u00a0238(1-2), 495\u2013498 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1017\/S0963548399003752","volume":"8","author":"R. \u0160krekovski","year":"1999","unstructured":"\u0160krekovski, R.: List improper colorings of planar graphs. Comb. Prob. Comp.\u00a08, 293\u2013299 (1999)","journal-title":"Comb. Prob. Comp."},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1006\/jctb.1998.1868","volume":"75","author":"C. Thomassen","year":"1999","unstructured":"Thomassen, C.: Two-colouring the edges of a cubic graph such that each monochromatic component is a path of length at most 5. J. Comb. Th. Series B\u00a075, 100\u2013109 (1999)","journal-title":"J. Comb. Th. Series B"},{"issue":"1","key":"14_CR19","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","volume":"8","author":"C. Tovey","year":"1984","unstructured":"Tovey, C.: A simplified NP-complete satisfiability problem. Discrete Appl. Math.\u00a08(1), 85\u201389 (1984)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841036_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:40:24Z","timestamp":1605624024000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841036_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388753","9783540388760"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11841036_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}