{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:47Z","timestamp":1759638047424},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319687049"},{"type":"electronic","value":"9783319687056"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68705-6_20","type":"book-chapter","created":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T06:06:22Z","timestamp":1509516382000},"page":"263-274","source":"Crossref","is-referenced-by-count":3,"title":["Linearly $$\\chi $$ \u03c7 -Bounding $$(P_6,C_4)$$ ( P 6 , C 4 ) -Free Graphs"],"prefix":"10.1007","author":[{"given":"Serge","family":"Gaspers","sequence":"first","affiliation":[]},{"given":"Shenwei","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,2]]},"reference":[{"key":"20_CR1","unstructured":"Bharathi, A.P., Choudum, S.A.: Colouring of \n            $$(P_3\\cup P_2)$$\n            \n              \n                \n                  (\n                  \n                    P\n                    3\n                  \n                  \u222a\n                  \n                    P\n                    2\n                  \n                  )\n                \n              \n            \n          -free graphs. \narXiv:1610.07177v1\n\n [cs.DM] (2016)"},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0012-365X(93)90477-B","volume":"115","author":"Z Bl\u00e1zsik","year":"1993","unstructured":"Bl\u00e1zsik, Z., Hujter, M., Pluh\u00e1r, A., Tuza, Z.: Graphs with no induced \n            $$C_4$$\n            \n              \n                \n                  C\n                  4\n                \n              \n            \n           and \n            $$2K_2$$\n            \n              \n                \n                  2\n                  \n                    K\n                    2\n                  \n                \n              \n            \n          . Discrete Math. 115, 51\u201355 (1993)","journal-title":"Discrete Math."},{"key":"20_CR3","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Graduate Texts in Mathematics, vol. 244. Springer, New York (2008)"},{"key":"20_CR4","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/j.tcs.2007.09.031","volume":"389","author":"A Brandst\u00e4dt","year":"2007","unstructured":"Brandst\u00e4dt, A., Ho\u00e0ng, C.T.: On clique separators, nearly chordal graphs, and the maximum weight stable set problem. Theor. Comput. Sci. 389, 295\u2013306 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR5","unstructured":"Brause, C., Randerath, B., Schiermeyer, I., Vumar, E.: On the chromatic number of \n            $$2K_2$$\n            \n              \n                \n                  2\n                  \n                    K\n                    2\n                  \n                \n              \n            \n          -free graphs. In: Bordeaux Graph Workshop (2016)"},{"key":"20_CR6","doi-asserted-by":"crossref","first-page":"3398","DOI":"10.1016\/j.disc.2010.08.005","volume":"310","author":"SA Choudum","year":"2010","unstructured":"Choudum, S.A., Karthick, T.: Maximal cliques in \n            $$\\{P_2\\cup P_3, C_4\\}$$\n            \n              \n                \n                  {\n                  \n                    P\n                    2\n                  \n                  \u222a\n                  \n                    P\n                    3\n                  \n                  ,\n                  \n                    C\n                    4\n                  \n                  }\n                \n              \n            \n          -free graphs. Discrete Math. 310, 3398\u20133403 (2010)","journal-title":"Discrete Math."},{"key":"20_CR7","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1002\/jgt.20212","volume":"54","author":"SA Choudum","year":"2007","unstructured":"Choudum, S.A., Karthick, T., Shalu, M.A.: Perfectly coloring and linearly \n            $$\\chi $$\n            \n              \n                \u03c7\n              \n            \n          -bound \n            $${P}_6$$\n            \n              \n                \n                  P\n                  6\n                \n              \n            \n          -free graphs. J. Graph Theory 54, 293\u2013306 (2007)","journal-title":"J. Graph Theory"},{"key":"20_CR8","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/s00373-008-0801-0","volume":"24","author":"SA Choudum","year":"2008","unstructured":"Choudum, S.A., Karthick, T., Shalu, M.A.: Linear chromatic bounds for a subfamily of \n            $$3K_1$$\n            \n              \n                \n                  3\n                  \n                    K\n                    1\n                  \n                \n              \n            \n          -free graphs. Graphs Comb. 24, 413\u2013428 (2008)","journal-title":"Graphs Comb."},{"key":"20_CR9","unstructured":"Dhanalakshmi, S., Sadagopan, N., Manogna, V.: On \n            $$2K_2$$\n            \n              \n                \n                  2\n                  \n                    K\n                    2\n                  \n                \n              \n            \n          -free graphs-structural and combinatorial view. \narXiv:1602.03802v2\n\n [math.CO] (2016)"},{"key":"20_CR10","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02992776","volume":"25","author":"GA Dirac","year":"1961","unstructured":"Dirac, G.A.: On rigid circuit graphs. Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg 25, 71\u201376 (1961)","journal-title":"Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg"},{"key":"20_CR11","doi-asserted-by":"crossref","first-page":"34","DOI":"10.4153\/CJM-1959-003-9","volume":"11","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P.: Graph theory and probability. Canad. J. Math. 11, 34\u201338 (1959)","journal-title":"Canad. J. Math."},{"key":"20_CR12","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0012-365X(94)00155-X","volume":"146","author":"JL Fouquet","year":"1995","unstructured":"Fouquet, J.L., Giakoumakis, V., Maire, F., Thuillier, H.: On graphs without \n            $${P}_5$$\n            \n              \n                \n                  P\n                  5\n                \n              \n            \n           and \n            $$\\overline{P_5}$$\n            \n              \n                \n                  \n                    P\n                    5\n                  \n                  \u00af\n                \n              \n            \n          . Discrete Math. 146, 33\u201344 (1995)","journal-title":"Discrete Math."},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Golovach, P.A., Johnson, M., Paulusma, D., Song, J.: A survey on the computational complexity of coloring graphs with forbidden subgraphs. J. Graph Theory (to appear)","DOI":"10.1002\/jgt.22028"},{"key":"20_CR14","first-page":"801","volume":"10","author":"A Gy\u00e1rf\u00e1s","year":"1973","unstructured":"Gy\u00e1rf\u00e1s, A.: On Ramsey covering numbers. Coll. Math. Soc. J\u00e1nos Bolyai 10, 801\u2013816 (1973)","journal-title":"Coll. Math. Soc. J\u00e1nos Bolyai"},{"key":"20_CR15","first-page":"413","volume":"19","author":"A Gy\u00e1rf\u00e1s","year":"1987","unstructured":"Gy\u00e1rf\u00e1s, A.: Problems from the world surrounding perfect graphs. Zastosow. Mat. 19, 413\u2013431 (1987)","journal-title":"Zastosow. Mat."},{"key":"20_CR16","doi-asserted-by":"crossref","first-page":"1900","DOI":"10.1016\/j.disc.2012.03.002","volume":"312","author":"MA Henning","year":"2012","unstructured":"Henning, M.A., L\u00f6wenstein, C., Rautenbach, D.: Independent sets and matchings in subcubic graphs. Discrete Math. 312, 1900\u20131910 (2012)","journal-title":"Discrete Math."},{"key":"20_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00373-003-0540-1","volume":"20","author":"B Randerath","year":"2004","unstructured":"Randerath, B., Schiermeyer, I.: Vertex colouring and forbidden subgraphs-a survey. Graphs Comb. 20, 1\u201340 (2004)","journal-title":"Graphs Comb."},{"key":"20_CR18","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0095-8956(80)90093-3","volume":"29","author":"S Wagon","year":"1980","unstructured":"Wagon, S.: A bound on the chromatic number of graphs without certain induced subgraphs. J. Combin. Theory Ser. B 29, 345\u2013346 (1980)","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68705-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T06:12:00Z","timestamp":1509516720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68705-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319687049","9783319687056"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68705-6_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}