{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T02:14:46Z","timestamp":1767924886306,"version":"3.49.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,11,28]],"date-time":"2012-11-28T00:00:00Z","timestamp":1354060800000},"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":[[2014,3]]},"DOI":"10.1007\/s00373-012-1270-z","type":"journal-article","created":{"date-parts":[[2012,11,29]],"date-time":"2012-11-29T13:57:28Z","timestamp":1354197448000},"page":"353-364","source":"Crossref","is-referenced-by-count":10,"title":["Solving Partition Problems with Colour-Bipartitions"],"prefix":"10.1007","volume":"30","author":[{"given":"Ross","family":"Churchley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,11,28]]},"reference":[{"issue":"1","key":"1270_CR1","first-page":"21","volume":"29","author":"Z. Bawar","year":"2005","unstructured":"Bawar Z., Brewster R., Marcotte D.: Homomorphism duality in edge-coloured graphs. Ann. Sci. Math. Qu\u00e9bec 29(1), 21\u201334 (2005)","journal-title":"Ann. Sci. Math. Qu\u00e9bec"},{"key":"1270_CR2","unstructured":"Brewster, R.: Vertex Colourings of Edge-Coloured Graphs. Ph.D. thesis, Simon Fraser University (1993)"},{"key":"1270_CR3","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0012-365X(86)90113-5","volume":"62","author":"Z.A. Chernyak","year":"1986","unstructured":"Chernyak Z.A., Chernyak A.A.: About recognizing (\u03b1, \u03b2) classes of polar graphs. Discret. Math. 62, 133\u2013138 (1986)","journal-title":"Discret. Math."},{"key":"1270_CR4","unstructured":"Churchley, R.: Some Remarks on Monopolarity. Manuscript (2012)"},{"key":"1270_CR5","unstructured":"Churchley, R.; Huang, J.: On the polarity and monopolarity of graphs. Submitted (2010)"},{"key":"1270_CR6","doi-asserted-by":"crossref","first-page":"1269","DOI":"10.1137\/100789208","volume":"25","author":"R. Churchley","year":"2011","unstructured":"Churchley R., Huang J.: Line-polar graphs: characterization and recognition. SIAM J. Discret. Math. 25, 1269\u20131284 (2011)","journal-title":"SIAM J. Discret. Math."},{"issue":"17","key":"1270_CR7","doi-asserted-by":"crossref","first-page":"2545","DOI":"10.1016\/j.disc.2011.08.022","volume":"312","author":"R. Churchley","year":"2012","unstructured":"Churchley R., Huang J.: List-monopolar partitions of claw-free graphs. Discret. Math. 312(17), 2545\u20132549 (2012)","journal-title":"Discret. Math."},{"key":"1270_CR8","unstructured":"Ekim, T.: Polarity of Claw-Free Graphs. Manuscript (2009)"},{"key":"1270_CR9","unstructured":"Ekim, T., Heggernes, P., Meister, D.: Polar permutation graphs. In: Combinatorial Algorithms: 20th International Workshop, IWOCA 20009, Lecture Notes in Computer Science. vol. 5874, 218\u2013229 (2009)"},{"issue":"13","key":"1270_CR10","doi-asserted-by":"crossref","first-page":"1652","DOI":"10.1016\/j.dam.2007.08.025","volume":"156","author":"T. Ekim","year":"2008","unstructured":"Ekim T., Hell P., Stacho J., de Werra D.: Polarity of chordal graphs. Discret. Appl. Math. 156(13), 1652\u20131660 (2008)","journal-title":"Discret. Appl. Math."},{"issue":"15","key":"1270_CR11","doi-asserted-by":"crossref","first-page":"1593","DOI":"10.1016\/j.dam.2010.05.019","volume":"158","author":"T. Ekim","year":"2010","unstructured":"Ekim T., Huang J.: Recognizing line-polar bipartite graphs in time O(n). Discret. Appl. Math. 158(15), 1593\u20131598 (2010)","journal-title":"Discret. Appl. Math."},{"issue":"10","key":"1270_CR12","doi-asserted-by":"crossref","first-page":"1652","DOI":"10.1016\/j.dam.2007.08.025","volume":"156","author":"T. Ekim","year":"2008","unstructured":"Ekim T., Mahadev N.V.R., de Werra D.: Polar cographs. Discret. Appl. Math. 156(10), 1652\u20131660 (2008)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"1270_CR13","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"Even S., Itai A., Shamir A.: On the complexity of timetable and multicommodity flow problems. SIAM J. Comput. 5(4), 691\u2013703 (1976)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"1270_CR14","doi-asserted-by":"crossref","first-page":"46","DOI":"10.37236\/1799","volume":"11","author":"A. Farrugia","year":"2004","unstructured":"Farrugia A.: Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard. Electr. J. Comb. 11(1), 46 (2004)","journal-title":"Electr. J. Comb."},{"key":"1270_CR15","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02020961","volume":"18","author":"T. Gallai","year":"1967","unstructured":"Gallai T.: Transitiv orientierbare graphen. Acta. Math. Acad. Sci. Hung. 18, 25\u201366 (1967)","journal-title":"Acta. Math. Acad. Sci. Hung."},{"key":"1270_CR16","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0020-0190(93)90038-B","volume":"45","author":"F. Gavril","year":"1993","unstructured":"Gavril F.: An efficiently solvable graph partition problem to which many problems are reducible. Inf. Process. Lett. 45, 285\u2013290 (1993)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"1270_CR17","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1016\/j.dam.2009.12.012","volume":"158","author":"J. Huang","year":"2010","unstructured":"Huang J., Xu B.: A forbidden subgraph characterization of line-polar bipartite graphs. Discret. Appl. Math. 158(6), 666\u2013680 (2010)","journal-title":"Discret. Appl. Math."},{"key":"1270_CR18","unstructured":"Le, V.B., Nevries, R.: Recognizing polar planar graphs using new results for monopolarity. In: Algorithms and Computation: 22nd International Symposium. ISAAC 2011, Lecture Notes in Computer Science. vol. 7074, 120\u2013129 (2011)"},{"key":"1270_CR19","unstructured":"Stacho, J.: Complexity of Generalized Colourings of Chordal Graphs. Ph.D. thesis, Simon Fraser University (2008)"},{"key":"1270_CR20","first-page":"16","volume":"6","author":"R.I. Tyshkevich","year":"1985","unstructured":"Tyshkevich R.I., Chernyak A.A.: Algorithms for the canonical decomposition of a graph and recognizing polarity. Izvestia Akad. Nauk BSSR, ser. Fiz. Mat. Nauk 6, 16\u201323 (1985)","journal-title":"Izvestia Akad. Nauk BSSR, ser. Fiz. Mat. Nauk"},{"key":"1270_CR21","first-page":"67","volume":"2","author":"R.I. Tyshkevich","year":"1985","unstructured":"Tyshkevich R.I., Chernyak A.A.: Decomposition of graphs. Kibernetika (Kiev) 2, 67\u201374 (1985)","journal-title":"Kibernetika (Kiev)"},{"key":"1270_CR22","unstructured":"West, D.: Introduction to Graph Theory. Prentice Hall, Englewood Cliffs, NJ (1996)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1270-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1270-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1270-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,17]],"date-time":"2020-07-17T04:16:16Z","timestamp":1594959376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1270-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,28]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["1270"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1270-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,28]]}}}