{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:49:14Z","timestamp":1770994154309,"version":"3.50.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031754081","type":"print"},{"value":"9783031754098","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-75409-8_15","type":"book-chapter","created":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:10:46Z","timestamp":1737497446000},"page":"211-219","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Face-Hitting Dominating Sets in\u00a0Planar Graphs"],"prefix":"10.1007","author":[{"given":"P.","family":"Francis","sequence":"first","affiliation":[]},{"given":"Abraham M.","family":"Illickan","sequence":"additional","affiliation":[]},{"given":"Lijo M.","family":"Jose","sequence":"additional","affiliation":[]},{"given":"Deepak","family":"Rajendraprasad","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,22]]},"reference":[{"issue":"3","key":"15_CR1","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s00454-009-9171-5","volume":"42","author":"N Alon","year":"2009","unstructured":"Alon, N., et al.: Polychromatic colorings of plane graphs. Discret. Comput. Geom. 42(3), 421\u2013442 (2009)","journal-title":"Discret. Comput. Geom."},{"key":"15_CR2","first-page":"429","volume":"21","author":"K Appel","year":"1977","unstructured":"Appel, K., Haken, W.: Every planar map is four colorable. I. Discharging. Illinois J. Math. 21, 429\u2013490 (1977)","journal-title":"Illinois J. Math."},{"key":"15_CR3","first-page":"491","volume":"21","author":"K Appel","year":"1977","unstructured":"Appel, K., Haken, W., Koch, J.: Every planar map is four colorable. II. Reducibility. Illinois J. Math. 21, 491\u2013567 (1977)","journal-title":"Illinois J. Math."},{"issue":"3","key":"15_CR4","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0925-7721(95)00034-8","volume":"7","author":"P Bose","year":"1997","unstructured":"Bose, P., Shermer, T., Toussaint, G., Zhu, B.: Guarding polyhedral terrains. Comput. Geom. 7(3), 173\u2013185 (1997)","journal-title":"Comput. Geom."},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Botler, F., Fernandes, C.G., Guti\u00e9rrez, J.: Independent dominating sets in planar triangulations. Electron. J. Comb. P2\u201312 (2024)","DOI":"10.37236\/12548"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Christiansen, A.B., Rotenberg, E., Rutschmann, D.: Triangulations admit dominating sets of size 2 n\/7. In: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1194\u20131240. SIAM (2024)","DOI":"10.1137\/1.9781611977912.47"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Claverol, M., et al.: Total domination in plane triangulations. Discret. Math. 344(1), 112179 (2021)","DOI":"10.1016\/j.disc.2020.112179"},{"issue":"2","key":"15_CR8","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/S0097539702419649","volume":"36","author":"FV Fomin","year":"2006","unstructured":"Fomin, F.V., Thilikos, D.M.: Dominating sets in planar graphs: branch-width and exponential speed-up. SIAM J. Comput. 36(2), 281\u2013309 (2006)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"15_CR9","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1002\/jgt.23014","volume":"105","author":"P Francis","year":"2024","unstructured":"Francis, P., Illickan, A.M., Jose, L.M., Rajendraprasad, D.: Disjoint total dominating sets in near-triangulations. J. Graph Theory 105(1), 68\u201377 (2024)","journal-title":"J. Graph Theory"},{"issue":"1","key":"15_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/jgt.10027","volume":"40","author":"W Goddard","year":"2002","unstructured":"Goddard, W., Henning, M.A.: Domination in planar graphs with small diameter. J. Graph Theory 40(1), 1\u201325 (2002)","journal-title":"J. Graph Theory"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Haynes, T.W., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs. CRC Press (2013)","DOI":"10.1201\/9781482246582"},{"key":"15_CR12","first-page":"270","volume":"29","author":"PJ Heawood","year":"1898","unstructured":"Heawood, P.J.: On the four-colour map theorem. Quart. J. Pure Appl. Math. 29, 270\u2013285 (1898)","journal-title":"Quart. J. Pure Appl. Math."},{"issue":"2","key":"15_CR13","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/S0895480194265611","volume":"9","author":"F Hoffmann","year":"1996","unstructured":"Hoffmann, F., Kriegel, K.: A graph-coloring result and its consequences for polygon-guarding problems. SIAM J. Discret. Math. 9(2), 210\u2013224 (1996)","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"15_CR14","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1016\/j.disc.2011.11.016","volume":"312","author":"E Horev","year":"2012","unstructured":"Horev, E., Katz, M.J., Krakovski, R., Nakamoto, A.: Polychromatic 4-coloring of cubic bipartite plane graphs. Discret. Math. 312(4), 715\u2013719 (2012)","journal-title":"Discret. Math."},{"issue":"4","key":"15_CR15","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1002\/jgt.20357","volume":"60","author":"E Horev","year":"2009","unstructured":"Horev, E., Krakovski, R.: Polychromatic colorings of bounded degree plane graphs. J. Graph Theory 60(4), 269\u2013283 (2009)","journal-title":"J. Graph Theory"},{"key":"15_CR16","unstructured":"Lov\u00e1sz, L.: Combinatorial Problems and Exercises. North Holland & Akad\u00e9miai Kiad\u00f3 (1979)"},{"issue":"3","key":"15_CR17","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1002\/(SICI)1097-0118(199607)22:3<213::AID-JGT2>3.0.CO;2-P","volume":"22","author":"G MacGillivray","year":"1996","unstructured":"MacGillivray, G., Seyffarth, K.: Domination numbers of planar graphs. J. Graph Theory 22(3), 213\u2013229 (1996)","journal-title":"J. Graph Theory"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1006\/eujc.1996.0048","volume":"17","author":"LR Matheson","year":"1996","unstructured":"Matheson, L.R., Tarjan, R.E.: Dominating sets in planar graphs. Eur. J. Combin. 17, 565\u2013568 (1996)","journal-title":"Eur. J. Combin."},{"issue":"3","key":"15_CR19","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1017\/S0963548300002042","volume":"5","author":"B Reed","year":"1996","unstructured":"Reed, B.: Paths, stars and the number three. Comb. Probab. Comput. 5(3), 277\u2013295 (1996)","journal-title":"Comb. Probab. Comput."},{"issue":"4","key":"15_CR20","doi-asserted-by":"publisher","first-page":"759","DOI":"10.4134\/JKMS.2009.46.4.759","volume":"46","author":"MY Sohn","year":"2009","unstructured":"Sohn, M.Y., Xudong, Y.: Domination in graphs of minimum degree four. J. Korean Math. Soc. 46(4), 759\u2013773 (2009)","journal-title":"J. Korean Math. Soc."},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.jctb.2019.11.005","volume":"143","author":"S \u0160pacapan","year":"2020","unstructured":"\u0160pacapan, S.: The domination number of plane triangulations. J. Combin. Theory Ser. B 143, 42\u201364 (2020)","journal-title":"J. Combin. Theory Ser. B"},{"key":"15_CR22","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s00373-006-0638-3","volume":"22","author":"HM Xing","year":"2006","unstructured":"Xing, H.M., Sun, L., Chen, X.G.: Domination in graphs of minimum degree five. Graphs Comb. 22, 127\u2013143 (2006)","journal-title":"Graphs Comb."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-75409-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:10:48Z","timestamp":1737497448000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-75409-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031754081","9783031754098"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-75409-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"22 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gozd Martuljek","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovenia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"50","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conferences.famnit.upr.si\/event\/31\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}