{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T03:27:54Z","timestamp":1771126074285,"version":"3.50.1"},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,2,1]],"date-time":"2018-02-01T00:00:00Z","timestamp":1517443200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["FP\/2007\u20132013"],"award-info":[{"award-number":["FP\/2007\u20132013"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005416","name":"Norges Forskningsr\u00e5d","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005416","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["267959"],"award-info":[{"award-number":["267959"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["GraphEn\/ANR-15-C\u00e40-0009"],"award-info":[{"award-number":["GraphEn\/ANR-15-C\u00e40-0009"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1016\/j.ejc.2017.07.015","type":"journal-article","created":{"date-parts":[[2017,8,24]],"date-time":"2017-08-24T01:16:12Z","timestamp":1503537372000},"page":"132-147","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":11,"special_numbering":"C","title":["Enumeration and maximum number of minimal connected vertex covers in graphs"],"prefix":"10.1016","volume":"68","author":[{"given":"Petr A.","family":"Golovach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pinar","family":"Heggernes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dieter","family":"Kratsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.ejc.2017.07.015_b1","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","article-title":"Distance-hereditary graphs","volume":"41","author":"Bandelt","year":"1986","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.ejc.2017.07.015_b2","doi-asserted-by":"crossref","unstructured":"M. Basavaraju, P. Heggernes, P. van\u00a0\u2019t Hof, R. Saei, Y. Villanger, Maximal induced matchings in triangle-free graphs, in: Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, 2014, pp. 93\u2013104.","DOI":"10.1007\/978-3-319-12340-0_8"},{"key":"10.1016\/j.ejc.2017.07.015_b3","series-title":"SIAM Monographs on Discrete Mathematics and Applications","article-title":"Graph classes: a survey","author":"Brandst\u00e4dt","year":"1999"},{"issue":"6","key":"10.1016\/j.ejc.2017.07.015_b4","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1016\/j.orl.2004.03.002","article-title":"Enumerating maximal independent sets with applications to graph colouring","volume":"32","author":"Byskov","year":"2004","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.ejc.2017.07.015_b5","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.tcs.2013.03.026","article-title":"Minimal dominating sets in graph classes: combinatorial bounds and enumeration","volume":"487","author":"Couturier","year":"2013","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.ejc.2017.07.015_b6","doi-asserted-by":"crossref","unstructured":"J. Couturier, P. Heggernes, P. van\u00a0\u2019t Hof, Y. Villanger, Maximum number of minimal feedback vertex sets in chordal graphs and cographs, in: Computing and Combinatorics - 18th Annual International Conference, COCOON 2012, 2012, pp. 133\u2013144.","DOI":"10.1007\/978-3-642-32241-9_12"},{"key":"10.1016\/j.ejc.2017.07.015_b7","series-title":"SWAT 2012","first-page":"95","article-title":"Deterministic parameterized connected vertex cover","volume":"vol. 7357","author":"Cygan","year":"2012"},{"issue":"3","key":"10.1016\/j.ejc.2017.07.015_b8","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1137\/0217032","article-title":"Distance-hereditary graphs, steiner trees, and connected domination","volume":"17","author":"D\u2019Atri","year":"1988","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.ejc.2017.07.015_b9","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.jda.2009.01.005","article-title":"Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs","volume":"8","author":"Escoffier","year":"2010","journal-title":"J. Discrete Algorithms"},{"issue":"2","key":"10.1016\/j.ejc.2017.07.015_b10","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s00453-007-9152-0","article-title":"On the minimum feedback vertex set problem: exact and enumeration algorithms","volume":"52","author":"Fomin","year":"2008","journal-title":"Algorithmica"},{"key":"10.1016\/j.ejc.2017.07.015_b11","doi-asserted-by":"crossref","unstructured":"F.V. Fomin, F. Grandoni, A.V. Pyatkin, A.A. Stepanov, Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications, ACM Trans. Algorithms 5\u00a0(1).","DOI":"10.1145\/1435375.1435384"},{"issue":"2","key":"10.1016\/j.ejc.2017.07.015_b12","first-page":"381","article-title":"Exact algorithms for graph homomorphisms","volume":"41","author":"Fomin","year":"2007","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/j.ejc.2017.07.015_b13","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/s00453-012-9731-6","article-title":"Enumerating minimal subset feedback vertex sets","volume":"69","author":"Fomin","year":"2014","journal-title":"Algorithmica"},{"key":"10.1016\/j.ejc.2017.07.015_b14","series-title":"Texts in Theoretical Computer Science","article-title":"Exact exponential algorithms","author":"Fomin","year":"2010"},{"key":"10.1016\/j.ejc.2017.07.015_b15","unstructured":"F.V. Fomin, Y. Villanger, Finding induced subgraphs via minimal triangulations, in: 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, 2010, pp. 383\u2013394."},{"key":"10.1016\/j.ejc.2017.07.015_b16","series-title":"Computers and Intractability: A Guide To the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"1","key":"10.1016\/j.ejc.2017.07.015_b17","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1002\/jgt.21631","article-title":"Feedback vertex sets in tournaments","volume":"72","author":"Gaspers","year":"2013","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.ejc.2017.07.015_b18","series-title":"Combinatorial Algorithms 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers","article-title":"Enumeration and maximum number of minimal connected vertex covers in graphs","volume":"vol. 9538","author":"Golovach","year":"2015"},{"key":"10.1016\/j.ejc.2017.07.015_b19","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.jda.2013.09.005","article-title":"Subset feedback vertex sets in chordal graphs","volume":"26","author":"Golovach","year":"2014","journal-title":"J. Discrete Algorithms"},{"key":"10.1016\/j.ejc.2017.07.015_b20","article-title":"Algorithmic graph theory and perfect graphs","volume":"vol. 57","author":"Golumbic","year":"2004"},{"issue":"2","key":"10.1016\/j.ejc.2017.07.015_b21","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1137\/0406022","article-title":"The number of maximal independent sets in triangle-free graphs","volume":"6","author":"Hujtera","year":"1993","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"10.1016\/j.ejc.2017.07.015_b22","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","article-title":"On generating all maximal independent sets","volume":"27","author":"Johnson","year":"1988","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/j.ejc.2017.07.015_b23","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/0020-0190(76)90065-X","article-title":"A note on the complexity of the chromatic number problem","volume":"5","author":"Lawler","year":"1976","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.ejc.2017.07.015_b24","series-title":"IBM Research Rep. RC-240","article-title":"A problem of maximum consistent subsets","author":"Miller","year":"1960"},{"key":"10.1016\/j.ejc.2017.07.015_b25","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF02760024","article-title":"On cliques in graphs","volume":"3","author":"Moon","year":"1965","journal-title":"Israel J. Math."},{"key":"10.1016\/j.ejc.2017.07.015_b26","series-title":"New Proofs for Strongly Chordal Graphs and Chordal Bipartite Graphs","author":"Pelsmajer","year":"2004"},{"issue":"3","key":"10.1016\/j.ejc.2017.07.015_b27","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1137\/0206036","article-title":"A new algorithm for generating all the maximal independent sets","volume":"6","author":"Tsukiyama","year":"1977","journal-title":"SIAM J. Comput."}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0195669817301233?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0195669817301233?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,6,8]],"date-time":"2022-06-08T19:15:58Z","timestamp":1654715758000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669817301233"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2]]},"references-count":27,"alternative-id":["S0195669817301233"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.ejc.2017.07.015","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[2018,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Enumeration and maximum number of minimal connected vertex covers in graphs","name":"articletitle","label":"Article Title"},{"value":"European Journal of Combinatorics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.ejc.2017.07.015","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}