{"id":"https://openalex.org/W2593107672","doi":"https://doi.org/10.1137/110845835","title":"Min-Max Relations for Odd Cycles in Planar Graphs","display_name":"Min-Max Relations for Odd Cycles in Planar Graphs","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2593107672","doi":"https://doi.org/10.1137/110845835","mag":"2593107672"},"language":"en","primary_location":{"id":"doi:10.1137/110845835","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110845835","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","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/A5027559065","display_name":"Daniel Kr\u00e1l\u034f\u030c","orcid":"https://orcid.org/0000-0001-8680-0890"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Daniel Kr\u00e1l'","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014744746","display_name":"Jean\u2010S\u00e9bastien Sereni","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jean-S\u00e9bastien Sereni","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5085438222","display_name":"Ladislav Stacho","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ladislav Stacho","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5027559065"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9369,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.85981308,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"26","issue":"3","first_page":"884","last_page":"895"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9983999729156494,"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"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9983999729156494,"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/T10374","display_name":"Advanced Graph Theory Research","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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9510999917984009,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.8964048624038696},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8399003744125366},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7641739845275879},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6537570953369141},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.627002477645874},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5365135073661804},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5135191082954407},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49283266067504883},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42787453532218933},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41262170672416687},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.05772042274475098},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.04491984844207764}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8964048624038696},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8399003744125366},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7641739845275879},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6537570953369141},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.627002477645874},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5365135073661804},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5135191082954407},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49283266067504883},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42787453532218933},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41262170672416687},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.05772042274475098},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.04491984844207764},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/110845835","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110845835","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1969037852","https://openalex.org/W1990901538","https://openalex.org/W2013332890","https://openalex.org/W2028436310","https://openalex.org/W2032222063","https://openalex.org/W2055148303","https://openalex.org/W2065754663","https://openalex.org/W2076192760","https://openalex.org/W2332112754","https://openalex.org/W2340149117","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2371352078","https://openalex.org/W2953461625","https://openalex.org/W2077383796","https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W2080136900","https://openalex.org/W2372768926","https://openalex.org/W2999799752","https://openalex.org/W2054458431","https://openalex.org/W3013576436"],"abstract_inverted_index":{"Let":[0],"$\\nu(G)$":[1],"be":[2],"the":[3,16,37],"maximum":[4],"number":[5,18],"of":[6,10,19],"vertex-disjoint":[7],"odd":[8],"cycles":[9],"a":[11],"graph":[12],"$G$":[13,24,32],"and":[14],"$\\tau(G)$":[15],"minimum":[17],"vertices":[20],"whose":[21],"removal":[22],"makes":[23],"bipartite.":[25],"We":[26],"show":[27],"that":[28],"$\\tau(G)\\le":[29,40],"6\\nu(G)$":[30],"if":[31],"is":[33],"planar.":[34],"This":[35],"improves":[36],"previous":[38],"bound":[39],"10\\nu(G)$":[41],"by":[42],"Fiorini":[43],"et":[44],"al.":[45],"[Math.":[46],"Program.":[47],"Ser.":[48],"B,":[49],"110":[50],"(2007),":[51],"pp.":[52],"71--91].":[53]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}