{"id":"https://openalex.org/W1884616034","doi":"https://doi.org/10.37236/2114","title":"Identifying Vertex Covers in Graphs","display_name":"Identifying Vertex Covers in Graphs","publication_year":2012,"publication_date":"2012-12-06","ids":{"openalex":"https://openalex.org/W1884616034","doi":"https://doi.org/10.37236/2114","mag":"1884616034"},"language":"en","primary_location":{"id":"doi:10.37236/2114","is_oa":true,"landing_page_url":"https://doi.org/10.37236/2114","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v19i4p32/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v19i4p32/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089473322","display_name":"Michael A. Henning","orcid":"https://orcid.org/0000-0001-8185-067X"},"institutions":[{"id":"https://openalex.org/I24027795","display_name":"University of Johannesburg","ror":"https://ror.org/04z6c2n17","country_code":"ZA","type":"education","lineage":["https://openalex.org/I24027795"]}],"countries":["ZA"],"is_corresponding":true,"raw_author_name":"Michael A Henning","raw_affiliation_strings":["University of Johannesburg"],"affiliations":[{"raw_affiliation_string":"University of Johannesburg","institution_ids":["https://openalex.org/I24027795"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012051081","display_name":"Anders Yeo","orcid":"https://orcid.org/0000-0003-0293-8708"},"institutions":[{"id":"https://openalex.org/I24027795","display_name":"University of Johannesburg","ror":"https://ror.org/04z6c2n17","country_code":"ZA","type":"education","lineage":["https://openalex.org/I24027795"]}],"countries":["ZA"],"is_corresponding":false,"raw_author_name":"Anders Yeo","raw_affiliation_strings":["University of Johannesburg"],"affiliations":[{"raw_affiliation_string":"University of Johannesburg","institution_ids":["https://openalex.org/I24027795"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5089473322"],"corresponding_institution_ids":["https://openalex.org/I24027795"],"apc_list":null,"apc_paid":null,"fwci":0.6912,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.69326082,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"19","issue":"4","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.9285143613815308},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.787531852722168},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.7105779051780701},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5830549597740173},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4959810674190521},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44441336393356323},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3651407063007355}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.9285143613815308},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.787531852722168},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.7105779051780701},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5830549597740173},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4959810674190521},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44441336393356323},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3651407063007355},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/2114","is_oa":true,"landing_page_url":"https://doi.org/10.37236/2114","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v19i4p32/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.37236/2114","is_oa":true,"landing_page_url":"https://doi.org/10.37236/2114","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v19i4p32/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G547830083","display_name":null,"funder_award_id":"Johannesburg","funder_id":"https://openalex.org/F4320323959","funder_display_name":"University of Johannesburg"}],"funders":[{"id":"https://openalex.org/F4320320671","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46"},{"id":"https://openalex.org/F4320323959","display_name":"University of Johannesburg","ror":"https://ror.org/04z6c2n17"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1884616034.pdf","grobid_xml":"https://content.openalex.org/works/W1884616034.grobid-xml"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W1493071618","https://openalex.org/W1562475352","https://openalex.org/W1978011353","https://openalex.org/W2056975974","https://openalex.org/W2065210330","https://openalex.org/W2068262188","https://openalex.org/W2168924128","https://openalex.org/W2326198126","https://openalex.org/W2739598182"],"related_works":["https://openalex.org/W3194471551","https://openalex.org/W4375956809","https://openalex.org/W1581373162","https://openalex.org/W2784911598","https://openalex.org/W4297950433","https://openalex.org/W4287023968","https://openalex.org/W4288279572","https://openalex.org/W1973978937","https://openalex.org/W4286909116","https://openalex.org/W4292635168"],"abstract_inverted_index":{"An":[0],"identifying":[1,64,77],"vertex":[2,65,78],"cover":[3,66,79],"in":[4,14,43,61,80,190],"a":[5,9,18,104,161],"graph":[6,105,177],"$G$":[7,15,25,44,70,102,159],"is":[8,71,103,137,142,160],"subset":[10],"$T$":[11,28],"of":[12,24,69,75,96,106,169,184],"vertices":[13],"that":[16,27,32,84,100,187],"has":[17],"nonempty":[19],"intersection":[20],"with":[21,112],"every":[22,40,54],"edge":[23,41],"such":[26],"distinguishes":[29],"the":[30,72,93,135,140,173,175,179,191],"edges,":[31],"is,":[33],"$e":[34,46],"\\cap":[35,47,51],"T":[36,48],"\\ne":[37,49],"\\emptyset$":[38],"for":[39,53,145],"$e$":[42,58],"and":[45,59,109,158,178],"f":[50],"T$":[52],"two":[55],"distinct":[56],"edges":[57],"$f$":[60],"$G$.":[62,81,97],"The":[63,164],"number":[67,95],"$\\tau_D(G)$":[68],"minimum":[73],"size":[74,110],"an":[76],"We":[82,98,150,194],"observe":[83],"$\\tau_D(G)":[85,117],"+":[86,123,127,130],"\\rho(G)":[87],"=":[88],"|V(G)|$,":[89],"where":[90],"$\\rho(G)$":[91],"denotes":[92],"packing":[94],"conjecture":[99,136,153,198],"if":[101],"order":[107],"$n$":[108],"$m$":[111],"maximum":[113],"degree":[114],"$\\Delta$,":[115],"then":[116,139],"\\le":[118],"\\left(":[119,128],"\\frac{\\Delta(\\Delta":[120],"-":[121],"1)}{\\Delta^2":[122],"1}":[124,131],"\\right)":[125,132],"n":[126],"\\frac{2}{\\Delta^2":[129],"m$.":[133],"If":[134],"true,":[138],"bound":[141],"best":[143],"possible":[144],"all":[146],"$\\Delta":[147,155,200],"\\ge":[148,156],"1$.":[149],"prove":[151,196],"this":[152,197],"when":[154,199],"1$":[157],"$\\Delta$-regular":[162],"graph.":[163],"three":[165],"known":[166],"Moore":[167],"graphs":[168,186],"diameter":[170],"two,":[171],"namely":[172],"$5$-cycle,":[174],"Petersen":[176],"Hoffman-Singleton":[180],"graph,":[181],"are":[182],"examples":[183],"regular":[185],"achieves":[188],"equality":[189],"upper":[192],"bound.":[193],"also":[195],"\\in":[201],"\\{2,3\\}$.":[202]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-13T07:58:08.660418","created_date":"2025-10-10T00:00:00"}