{"id":"https://openalex.org/W2002729802","doi":"https://doi.org/10.1002/1097-0118(200007)34:3<204::aid-jgt2>3.0.co;2-p","title":"Triangle-free graphs that are signable without even holes","display_name":"Triangle-free graphs that are signable without even holes","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2002729802","doi":"https://doi.org/10.1002/1097-0118(200007)34:3<204::aid-jgt2>3.0.co;2-p","mag":"2002729802"},"language":"en","primary_location":{"id":"doi:10.1002/1097-0118(200007)34:3<204::aid-jgt2>3.0.co;2-p","is_oa":false,"landing_page_url":"https://doi.org/10.1002/1097-0118(200007)34:3<204::aid-jgt2>3.0.co;2-p","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":true,"raw_author_name":"Michele Conforti","raw_affiliation_strings":["Dipartimento di Matematica Pura ed Applicata, Universita\u0300 di Padova, Via Belzoni 7, 35131 Padova, Italy","Dipartimento di Matematica Pura ed Applicata, Universita di Padova, Via Belzoni 7, 35131 Padova, Italy#TAB#"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica Pura ed Applicata, Universita\u0300 di Padova, Via Belzoni 7, 35131 Padova, Italy","institution_ids":["https://openalex.org/I138689650"]},{"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":null,"display_name":"G\ufffdrard Cornu\ufffdjols","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":"G\ufffdrard Cornu\ufffdjols","raw_affiliation_strings":["GSIA Carnegie Mellon University, Schenley Park, Pittsburgh. PA 15213#TAB#"],"affiliations":[{"raw_affiliation_string":"GSIA Carnegie Mellon University, Schenley Park, Pittsburgh. PA 15213#TAB#","institution_ids":["https://openalex.org/I74973139"]}]},{"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":["GSIA Carnegie Mellon University, Schenley Park, Pittsburgh. PA 15213","GSIA Carnegie Mellon University, Schenley Park, Pittsburgh. PA 15213#TAB#"],"affiliations":[{"raw_affiliation_string":"GSIA Carnegie Mellon University, Schenley Park, Pittsburgh. PA 15213","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"GSIA Carnegie Mellon University, Schenley Park, Pittsburgh. PA 15213#TAB#","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":null,"display_name":"Kristina Vu?kovi?","orcid":null},"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?kovi?","raw_affiliation_strings":["Department of Mathematics , University of Kentucky , Lexington, KY, 40506"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics , University of Kentucky , Lexington, KY, 40506","institution_ids":["https://openalex.org/I143302722"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5091505775"],"corresponding_institution_ids":["https://openalex.org/I138689650"],"apc_list":{"value":3760,"currency":"USD","value_usd":3760},"apc_paid":null,"fwci":0.9374,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.75210456,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"34","issue":"3","first_page":"204","last_page":"220"},"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9987000226974487,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983000159263611,"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/mathematics","display_name":"Mathematics","score":0.7954946160316467},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7805819511413574},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.6486960649490356},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.5836244821548462},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5408246517181396},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.5055878162384033},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4963238835334778},{"id":"https://openalex.org/keywords/robertson\u2013seymour-theorem","display_name":"Robertson\u2013Seymour theorem","score":0.4785759449005127},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.47625231742858887},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.47301581501960754},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4673846960067749},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.45835959911346436},{"id":"https://openalex.org/keywords/modular-decomposition","display_name":"Modular decomposition","score":0.4503336548805237},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4013044238090515},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15764743089675903},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09813287854194641}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7954946160316467},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7805819511413574},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.6486960649490356},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.5836244821548462},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5408246517181396},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.5055878162384033},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4963238835334778},{"id":"https://openalex.org/C173644813","wikidata":"https://www.wikidata.org/wiki/Q3527155","display_name":"Robertson\u2013Seymour theorem","level":5,"score":0.4785759449005127},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.47625231742858887},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.47301581501960754},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4673846960067749},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.45835959911346436},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.4503336548805237},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4013044238090515},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15764743089675903},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09813287854194641},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1002/1097-0118(200007)34:3<204::aid-jgt2>3.0.co;2-p","is_oa":false,"landing_page_url":"https://doi.org/10.1002/1097-0118(200007)34:3<204::aid-jgt2>3.0.co;2-p","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:oai:CiteSeerX.psu:10.1.1.532.9683","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.532.9683","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/trianglefree.pdf","raw_type":"text"},{"id":"pmh:oai:www.research.unipd.it:11577/3197049","is_oa":false,"landing_page_url":"http://hdl.handle.net/11577/3197049","pdf_url":null,"source":{"id":"https://openalex.org/S4306402547","display_name":"Padua Research Archive (University of Padova)","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":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"mag:2002729802","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/jgt/jgt34.html#ConfortiCKV00","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1995303433","https://openalex.org/W2020585303","https://openalex.org/W2036522563","https://openalex.org/W2042708383","https://openalex.org/W2060685279","https://openalex.org/W2082100385","https://openalex.org/W4210316907","https://openalex.org/W4252569207"],"related_works":["https://openalex.org/W2082100385","https://openalex.org/W2140934298","https://openalex.org/W2116428534","https://openalex.org/W2022783208","https://openalex.org/W1973199140","https://openalex.org/W2026183431","https://openalex.org/W2093951432","https://openalex.org/W2060685279","https://openalex.org/W2156047590","https://openalex.org/W2120261735","https://openalex.org/W2104062785","https://openalex.org/W2096563151","https://openalex.org/W1991728994","https://openalex.org/W1986908827","https://openalex.org/W2103990213","https://openalex.org/W2042708383","https://openalex.org/W1996804679","https://openalex.org/W1995521164","https://openalex.org/W1965570465","https://openalex.org/W1971319751"],"abstract_inverted_index":{"We":[0,45],"characterize":[1],"triangle-free":[2],"graphs":[3,27],"for":[4],"which":[5],"there":[6],"exists":[7],"a":[8,33,47,62],"subset":[9],"of":[10,21,32],"edges":[11,22],"that":[12],"intersects":[13],"every":[14],"chordless":[15],"cycle":[16],"in":[17,53],"an":[18],"odd":[19],"number":[20],"(TF":[23],"odd-signable":[24,38],"graphs).":[25],"These":[26],"arise":[28],"as":[29],"building":[30],"blocks":[31],"decomposition":[34,63],"theorem":[35],"(for":[36],"cap-free":[37],"graphs)":[39],"obtained":[40],"by":[41],"the":[42],"same":[43],"authors.":[44],"give":[46],"polytime":[48],"algorithm":[49,57],"to":[50],"test":[51],"membership":[52],"this":[54],"class.":[55],"This":[56],"is":[58],"itself":[59],"based":[60],"on":[61],"theorem.":[64],"\u00a9":[65],"2000":[66,77],"John":[67],"Wiley":[68],"&":[69],"Sons,":[70],"Inc.":[71],"J":[72],"Graph":[73],"Theory":[74],"34:":[75],"204\u2013220,":[76]},"counts_by_year":[{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}