{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T08:15:51Z","timestamp":1783584951576,"version":"3.55.0"},"reference-count":23,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003845","name":"Indian Institute of Technology Madras","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003845","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001501","name":"University Grants Commission","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001501","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.dam.2026.06.031","type":"journal-article","created":{"date-parts":[[2026,7,6]],"date-time":"2026-07-06T13:00:20Z","timestamp":1783342820000},"page":"246-267","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Complexity of (p,q)-bipartition of planar and 1-planar graphs"],"prefix":"10.1016","volume":"393","author":[{"given":"Cyriac","family":"Antony","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Abhimanyoo","family":"Karve","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8393-9109","authenticated-orcid":false,"given":"Sounaka","family":"Mishra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.dam.2026.06.031_b1","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/j.disc.2018.10.013","article-title":"Planar bipartite biregular degree sequences","volume":"342","author":"Adams","year":"2019","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.06.031_b2","series-title":"Characterizing Boolean Satisfiability Variants","author":"Antunes Filho","year":"2019"},{"issue":"2","key":"10.1016\/j.dam.2026.06.031_b3","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1002\/jgt.22444","article-title":"Bipartite spanning sub (di) graphs induced by 2-partitions","volume":"92","author":"Bang-Jensen","year":"2019","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2026.06.031_b4","series-title":"On simplified NP-complete variants of not-all-equal 3-sat and 3-sat","author":"Darmann","year":"2019"},{"key":"10.1016\/j.dam.2026.06.031_b5","series-title":"Introduction to Computational Complexity","author":"Du","year":"2002"},{"key":"10.1016\/j.dam.2026.06.031_b6","series-title":"Elementa doctrinae solidorum","first-page":"109","author":"Euler","year":"1758"},{"issue":"7\u20138","key":"10.1016\/j.dam.2026.06.031_b7","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1016\/j.disc.2005.11.056","article-title":"The structure of 1-planar graphs","volume":"307","author":"Fabrici","year":"2007","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.06.031_b8","volume":"vol. 174","author":"Garey","year":"1979"},{"key":"10.1016\/j.dam.2026.06.031_b9","doi-asserted-by":"crossref","unstructured":"M.R. Garey, D.S. Johnson, L. Stockmeyer, Some simplified NP-complete problems, in: Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, 1974, pp. 47\u201363.","DOI":"10.1145\/800119.803884"},{"key":"10.1016\/j.dam.2026.06.031_b10","series-title":"Beyond Planar Graphs: Communications of NII Shonan Meetings","first-page":"47","author":"planar graphs","year":"2020"},{"issue":"1","key":"10.1016\/j.dam.2026.06.031_b11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00453-007-0010-x","article-title":"Algorithms for graphs embeddable with few crossings per edge","volume":"49","author":"Grigoriev","year":"2007","journal-title":"Algorithmica"},{"key":"10.1016\/j.dam.2026.06.031_b12","unstructured":"S.M. Hedetniemi, S.T. Hedetniemi, R.C. Laskar, L. Markus, P.J. Slater, Disjoint dominating sets in graphs, in: Proceedings of the international conference on discrete mathematics (ICDM 2006), Bangalore, India, December 15\u201318, 2006, 2008, pp. 87\u2013100, Mysore: Ramanujan Mathematical Society."},{"issue":"23\u201324","key":"10.1016\/j.dam.2026.06.031_b13","doi-asserted-by":"crossref","first-page":"6451","DOI":"10.1016\/j.disc.2009.06.017","article-title":"Remarks about disjoint dominating sets","volume":"309","author":"Henning","year":"2009","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.dam.2026.06.031_b14","doi-asserted-by":"crossref","first-page":"139","DOI":"10.7151\/dmgt.1652","article-title":"On graphs with disjoint dominating and 2-dominating sets","volume":"33","author":"Henning","year":"2013","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.dam.2026.06.031_b15","series-title":"Graphs with disjoint 2-dominating sets","author":"Henning","year":"2021"},{"issue":"4","key":"10.1016\/j.dam.2026.06.031_b16","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","article-title":"Efficient planarity testing","volume":"21","author":"Hopcroft","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/j.dam.2026.06.031_b17","series-title":"On the sizes of bipartite 1-planar graphs","author":"Huang","year":"2020"},{"issue":"2","key":"10.1016\/j.dam.2026.06.031_b18","doi-asserted-by":"crossref","first-page":"385","DOI":"10.7151\/dmgt.1454","article-title":"On local structure of 1-planar graphs of minimum degree 5 and girth 4","volume":"29","author":"Hud\u00e1k","year":"2009","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.dam.2026.06.031_b19","first-page":"12","article-title":"Upper bound on the number of edges of an almost planar bipartite graph","volume":"406","author":"Karpov","year":"2012","journal-title":"Zap. Nauchnykh Semin. POMI"},{"key":"10.1016\/j.dam.2026.06.031_b20","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.cosrev.2017.06.002","article-title":"An annotated bibliography on 1-planarity","volume":"25","author":"Kobourov","year":"2017","journal-title":"Comput. Sci. Rev."},{"issue":"2","key":"10.1016\/j.dam.2026.06.031_b21","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1137\/0404022","article-title":"Noncrossing subgraphs in topological layouts","volume":"4","author":"Kratochv\u00edl","year":"1991","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.dam.2026.06.031_b22","first-page":"107","article-title":"Ein sechsfarbenproblem auf der kugel","volume":"vol. 29","author":"Ringel","year":"1965"},{"key":"10.1016\/j.dam.2026.06.031_b23","doi-asserted-by":"crossref","unstructured":"T.J. Schaefer, The complexity of satisfiability problems, in: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, 1978, pp. 216\u2013226.","DOI":"10.1145\/800133.804350"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26003550?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26003550?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T07:29:03Z","timestamp":1783582143000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26003550"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":23,"alternative-id":["S0166218X26003550"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.06.031","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Complexity of -bipartition of planar and 1-planar graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.06.031","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}