{"id":"https://openalex.org/W2058522799","doi":"https://doi.org/10.1007/s003730050051","title":"Contractible Non-Edges in Triangle-Free Graphs","display_name":"Contractible Non-Edges in Triangle-Free Graphs","publication_year":1999,"publication_date":"1999-12-01","ids":{"openalex":"https://openalex.org/W2058522799","doi":"https://doi.org/10.1007/s003730050051","mag":"2058522799"},"language":"en","primary_location":{"id":"doi:10.1007/s003730050051","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s003730050051","pdf_url":null,"source":{"id":"https://openalex.org/S186126824","display_name":"Graphs and Combinatorics","issn_l":"0911-0119","issn":["0911-0119","1435-5914"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Graphs and Combinatorics","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/A5037836325","display_name":"Matthias Kriesell","orcid":"https://orcid.org/0000-0002-7302-7496"},"institutions":[{"id":"https://openalex.org/I114112103","display_name":"Leibniz University Hannover","ror":"https://ror.org/0304hq317","country_code":"DE","type":"education","lineage":["https://openalex.org/I114112103"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Matthias Kriesell","raw_affiliation_strings":["Institut f\u00fcr Mathematik (A), Universit\u00e4t Hannover, Welfengarten 1, D-30167 Hannover, Germany. e-mail: kriesell@math.uni-hannover.de, , , , , , DE","Institut f\u00fcr Mathematik (A), Universit\u00e4t Hannover, Welfengarten 1, D-30167 Hannover, Germany e-mail: kriesell@math.uni-hannover.de, DE"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Mathematik (A), Universit\u00e4t Hannover, Welfengarten 1, D-30167 Hannover, Germany. e-mail: kriesell@math.uni-hannover.de, , , , , , DE","institution_ids":["https://openalex.org/I114112103"]},{"raw_affiliation_string":"Institut f\u00fcr Mathematik (A), Universit\u00e4t Hannover, Welfengarten 1, D-30167 Hannover, Germany e-mail: kriesell@math.uni-hannover.de, DE","institution_ids":["https://openalex.org/I114112103"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5037836325"],"corresponding_institution_ids":["https://openalex.org/I114112103"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.4871,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.66216563,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"15","issue":"4","first_page":"429","last_page":"439"},"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.9973999857902527,"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.9944000244140625,"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.8605241775512695},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8451137542724609},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6363376379013062},{"id":"https://openalex.org/keywords/contractible-space","display_name":"Contractible space","score":0.49597057700157166},{"id":"https://openalex.org/keywords/triangle-free-graph","display_name":"Triangle-free graph","score":0.49199625849723816},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48490720987319946},{"id":"https://openalex.org/keywords/robertson\u2013seymour-theorem","display_name":"Robertson\u2013Seymour theorem","score":0.44918757677078247},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.41076645255088806},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40654510259628296},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.24899914860725403},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.24616363644599915}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8605241775512695},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8451137542724609},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6363376379013062},{"id":"https://openalex.org/C169611556","wikidata":"https://www.wikidata.org/wiki/Q230689","display_name":"Contractible space","level":2,"score":0.49597057700157166},{"id":"https://openalex.org/C114727528","wikidata":"https://www.wikidata.org/wiki/Q7840044","display_name":"Triangle-free graph","level":5,"score":0.49199625849723816},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48490720987319946},{"id":"https://openalex.org/C173644813","wikidata":"https://www.wikidata.org/wiki/Q3527155","display_name":"Robertson\u2013Seymour theorem","level":5,"score":0.44918757677078247},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.41076645255088806},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40654510259628296},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.24899914860725403},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.24616363644599915}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s003730050051","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s003730050051","pdf_url":null,"source":{"id":"https://openalex.org/S186126824","display_name":"Graphs and Combinatorics","issn_l":"0911-0119","issn":["0911-0119","1435-5914"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Graphs and Combinatorics","raw_type":"journal-article"}],"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/W1516768651","https://openalex.org/W1971578995","https://openalex.org/W1988512979","https://openalex.org/W1996853807","https://openalex.org/W2027555590","https://openalex.org/W2033985129","https://openalex.org/W2053580831","https://openalex.org/W2070459622","https://openalex.org/W2090062879"],"related_works":["https://openalex.org/W4288374556","https://openalex.org/W2935105326","https://openalex.org/W4316652266","https://openalex.org/W4294294408","https://openalex.org/W3037054849","https://openalex.org/W2913147187","https://openalex.org/W4312051281","https://openalex.org/W2107875203","https://openalex.org/W2103879540","https://openalex.org/W4390722723"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}