{"id":"https://openalex.org/W2082100385","doi":"https://doi.org/10.1002/(sici)1097-0118(199904)30:4<289::aid-jgt4>3.0.co;2-3","title":"Even and odd holes in cap-free graphs","display_name":"Even and odd holes in cap-free graphs","publication_year":1999,"publication_date":"1999-04-01","ids":{"openalex":"https://openalex.org/W2082100385","doi":"https://doi.org/10.1002/(sici)1097-0118(199904)30:4<289::aid-jgt4>3.0.co;2-3","mag":"2082100385"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1097-0118(199904)30:4<289::aid-jgt4>3.0.co;2-3","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0118(199904)30:4<289::aid-jgt4>3.0.co;2-3","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5091505775","display_name":"Michele Conforti","orcid":null},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Michele Conforti","raw_affiliation_strings":["Dipartimento di Matematica Pura ed Applicata, Universita di Padova, Via Belzoni 7, 35131 Padova, Italy#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica Pura ed Applicata, Universita di Padova, Via Belzoni 7, 35131 Padova, Italy#TAB#","institution_ids":["https://openalex.org/I138689650"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014470090","display_name":"G\u00e9rard Cornu\u00e9jols","orcid":"https://orcid.org/0000-0002-3976-1021"},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"G\u00e9rard Cornu\u00e9jols","raw_affiliation_strings":["Dipartimento di Matematica Pura ed Applicata, Universita di Padova, Via Belzoni 7, 35131 Padova, Italy#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica Pura ed Applicata, Universita di Padova, Via Belzoni 7, 35131 Padova, Italy#TAB#","institution_ids":["https://openalex.org/I138689650"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027416299","display_name":"Ajai Kapoor","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ajai Kapoor","raw_affiliation_strings":["Carnegie Mellon University, Schenley Park, Pittsburgh, PA 15213#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Schenley Park, Pittsburgh, PA 15213#TAB#","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077118262","display_name":"Kristina Vu\u0161kovi\u0107","orcid":"https://orcid.org/0000-0003-3286-3145"},"institutions":[{"id":"https://openalex.org/I143302722","display_name":"University of Kentucky","ror":"https://ror.org/02k3smh20","country_code":"US","type":"education","lineage":["https://openalex.org/I143302722"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kristina Vu\u0161kovi\u0107","raw_affiliation_strings":["Department of Mathematics University of Kentucky Lexington KY 40506 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics University of Kentucky Lexington KY 40506 USA","institution_ids":["https://openalex.org/I143302722"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3760,"currency":"USD","value_usd":3760},"apc_paid":null,"fwci":2.4501,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.88966043,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"30","issue":"4","first_page":"289","last_page":"308"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8164248466491699},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.772652804851532},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5320758819580078},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46446365118026733},{"id":"https://openalex.org/keywords/perfect-graph","display_name":"Perfect graph","score":0.4267261028289795},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4250991642475128},{"id":"https://openalex.org/keywords/strong-perfect-graph-theorem","display_name":"Strong perfect graph theorem","score":0.4190073013305664},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.31849220395088196},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.2776261568069458},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.25756150484085083},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.23400363326072693}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8164248466491699},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.772652804851532},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5320758819580078},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46446365118026733},{"id":"https://openalex.org/C32972407","wikidata":"https://www.wikidata.org/wiki/Q1187620","display_name":"Perfect graph","level":5,"score":0.4267261028289795},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4250991642475128},{"id":"https://openalex.org/C51044901","wikidata":"https://www.wikidata.org/wiki/Q16680059","display_name":"Strong perfect graph theorem","level":5,"score":0.4190073013305664},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.31849220395088196},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.2776261568069458},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.25756150484085083},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.23400363326072693}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1002/(sici)1097-0118(199904)30:4<289::aid-jgt4>3.0.co;2-3","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0118(199904)30:4<289::aid-jgt4>3.0.co;2-3","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","raw_type":"journal-article"},{"id":"doi:10.1002/(sici)1097-0118(199904)30:4<289::aid-jgt4>3.3.co;2-v","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0118(199904)30:4<289::aid-jgt4>3.3.co;2-v","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","raw_type":"journal-article"},{"id":"pmh:hdl:10068/316561","is_oa":false,"landing_page_url":"http://hdl.handle.net/10068/316561","pdf_url":null,"source":{"id":"https://openalex.org/S4377196900","display_name":"OpenGrey (Institut de l'Information Scientifique et Technique)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1295345811","host_organization_name":"Institut de l'Information Scientifique et Technique","host_organization_lineage":["https://openalex.org/I1295345811"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Y - Progress report"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.99.8240","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.99.8240","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.comp.leeds.ac.uk/vuskovi/capfree.pdf","raw_type":"text"},{"id":"pmh:oai:www.research.unipd.it:11577/100467","is_oa":false,"landing_page_url":"http://hdl.handle.net/11577/100467","pdf_url":null,"source":{"id":"https://openalex.org/S4377196283","display_name":"Research Padua  Archive (University of Padua)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I138689650","host_organization_name":"University of Padua","host_organization_lineage":["https://openalex.org/I138689650"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"mag:2082100385","is_oa":false,"landing_page_url":"http://www.comp.leeds.ac.uk/vuskovi/capfree.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Journal of Graph Theory","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W204449457","https://openalex.org/W1513284784","https://openalex.org/W1968161962","https://openalex.org/W2035331304","https://openalex.org/W2036522563","https://openalex.org/W2042708383","https://openalex.org/W2060685279","https://openalex.org/W2070075565","https://openalex.org/W2093951432"],"related_works":["https://openalex.org/W1973199140","https://openalex.org/W2042708383","https://openalex.org/W2026183431","https://openalex.org/W2022783208","https://openalex.org/W2156047590","https://openalex.org/W2116428534","https://openalex.org/W2140934298","https://openalex.org/W2035331304","https://openalex.org/W1991728994","https://openalex.org/W2120261735","https://openalex.org/W2093951432","https://openalex.org/W2104062785","https://openalex.org/W2060685279","https://openalex.org/W968859509","https://openalex.org/W2036522563","https://openalex.org/W1996804679","https://openalex.org/W204449457","https://openalex.org/W2002729802","https://openalex.org/W1968402726","https://openalex.org/W1965570465"],"abstract_inverted_index":{"It":[0],"is":[1,52,86,125,178,183,188,210,231,236,243,282,298,306,334,356,364],"an":[2,64,81,132],"old":[3],"problem":[4,94],"in":[5],"graph":[6,12,44,50,209,242,281,355,404],"theory":[7],"to":[8,107,199,308,336,396,406],"test":[9],"whether":[10,97,402],"a":[11,14,24,49,101,104,116,145,148,196,239,299,303,318,347,354,403],"contains":[13,100,131],"chordless":[15],"cycle":[16,221],"of":[17,32,95,103,113,123,137,150,203,222,255,340,350,408],"length":[18,223,256],"greater":[19],"than":[20],"three":[21],"(hole)":[22],"with":[23,226,258,267,302],"specific":[25],"parity":[26,106],"(even,":[27],"odd).":[28],"Studying":[29],"the":[30,93,108,314,337],"structure":[31],"graphs":[33,322,370,374],"without":[34],"odd":[35,65,118,126,133,138,153,161,179,184,189,273],"holes":[36],"has":[37,115],"obvious":[38],"implications":[39],"for":[40,141,288,321,344,386,400],"Berge's":[41],"strong":[42],"perfect":[43,53],"conjecture":[45],"that":[46,48,73,157,170,175,219,248,253,323,375],"states":[47],"G":[51,59,76,85,114],"if":[54,57,74,129,213],"and":[55,69,154,162,180,185,205,233,263,292,342,389],"only":[56],"neither":[58,75],"nor":[60,77],"its":[61,78],"complement":[62,79],"contain":[63,80,324],"hole.":[66,315],"Markossian,":[67],"Gasparian,":[68],"Reed":[70],"have":[71],"proven":[72],"even":[82,155,165,232,262],"hole,":[83],"then":[84,362],"\u03b2-perfect.":[87],"In":[88,366],"this":[89],"article,":[90],"we":[91,382],"extend":[92],"testing":[96,401],"G(V,":[98],"E)":[99],"hole":[102,164,187,300],"given":[105],"case":[109],"where":[110],"each":[111],"edge":[112],"label":[117],"or":[119,359],"even.":[120],"A":[121,208,296],"subset":[122],"E":[124,151],"(resp.":[127,134],"even)":[128,135],"it":[130,214,363],"number":[136],"edges.":[139],"Graphs":[140,169,247],"which":[142,305],"there":[143],"exists":[144],"signing":[146],"(i.e.,":[147],"partition":[149],"into":[152],"edges)":[156],"makes":[158],"every":[159,163,176,181,186,220,234],"triangle":[160,177,182,235],"are":[166,190,261,272,274,371,376],"called":[167,191,275],"even-signable.":[168,377],"can":[171,215,249],"be":[172,216,250],"signed":[173,217,251],"so":[174,218,252],"odd-signable.":[192,277,283],"We":[193,284,316],"derive":[194,317,383],"from":[195],"theorem":[197,320,333,339],"due":[198],"Truemper":[200],"co-NP":[201,286],"characterizations":[202,287],"even-signable":[204,212,241,244,291,358,369,391],"odd-signable":[206,280,294,388],"graphs.":[207,295,352,392],"strongly":[211,240,276,279,290,293,357,360,368,387,390],"\u2265":[224],"4":[225],"at":[227,268],"most":[228,269],"one":[229,259,270,407],"chord":[230,260,271],"odd.":[237],"Clearly":[238],"as":[245,327],"well.":[246],"cycles":[254,266],"four":[257],"all":[264],"other":[265],"Every":[278],"give":[285],"both":[289],"cap":[297,326],"together":[301],"node,":[304],"adjacent":[307,311],"exactly":[309],"two":[310],"nodes":[312],"on":[313],"decomposition":[319,338,380,384],"no":[325],"induced":[328],"subgraph":[329],"(cap-free":[330],"graphs).":[331],"Our":[332],"analogous":[335],"Burlet":[341],"Fonlupt":[343],"Meyniel":[345],"graphs,":[346],"well-studied":[348],"subclass":[349],"cap-free":[351,373],"If":[353],"odd-signable,":[361],"cap-free.":[365],"fact,":[367],"those":[372],"From":[378],"our":[379],"theorem,":[381],"results":[385,394],"These":[393],"lead":[395],"polynomial":[397],"recognition":[398],"algorithms":[399],"belongs":[405],"these":[409],"classes.":[410],"\u00a9":[411],"1999":[412,423],"John":[413],"Wiley":[414],"&":[415],"Sons,":[416],"Inc.":[417],"J":[418],"Graph":[419],"Theory":[420],"30:":[421],"289\u2013308,":[422]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":5},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-06-21T07:57:09.225873","created_date":"2025-10-10T00:00:00"}