{"id":"https://openalex.org/W2062824568","doi":"https://doi.org/10.1002/jgt.3190060204","title":"On maximum bipartite subgraphs","display_name":"On maximum bipartite subgraphs","publication_year":1982,"publication_date":"1982-06-01","ids":{"openalex":"https://openalex.org/W2062824568","doi":"https://doi.org/10.1002/jgt.3190060204","mag":"2062824568"},"language":"en","primary_location":{"id":"doi:10.1002/jgt.3190060204","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190060204","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/A5067574145","display_name":"G\u00fcnther Malle","orcid":null},"institutions":[{"id":"https://openalex.org/I4210166741","display_name":"University of Klagenfurt","ror":"https://ror.org/05q9m0937","country_code":"AT","type":"education","lineage":["https://openalex.org/I4210166741"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"G\u00fcnther Malle","raw_affiliation_strings":["Universita\u0308t Fu\u0308r Bildungswissenschaften, Klagenfurt, Austria","Universit\u00e4t F\u00fcr Bildungswissenschaften, Klagenfurt, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universita\u0308t Fu\u0308r Bildungswissenschaften, Klagenfurt, Austria","institution_ids":["https://openalex.org/I4210166741"]},{"raw_affiliation_string":"Universit\u00e4t F\u00fcr Bildungswissenschaften, Klagenfurt, Austria","institution_ids":["https://openalex.org/I4210166741"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5067574145"],"corresponding_institution_ids":["https://openalex.org/I4210166741"],"apc_list":{"value":3760,"currency":"USD","value_usd":3760},"apc_paid":null,"fwci":1.0984,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.77584399,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"6","issue":"2","first_page":"105","last_page":"113"},"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9998000264167786,"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/T11476","display_name":"Graph theory and applications","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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/bipartite-graph","display_name":"Bipartite graph","score":0.8810309171676636},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8674966096878052},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7779197692871094},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.6388249397277832},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.5753300786018372},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4944596290588379},{"id":"https://openalex.org/keywords/pancyclic-graph","display_name":"Pancyclic graph","score":0.46159908175468445},{"id":"https://openalex.org/keywords/strong-perfect-graph-theorem","display_name":"Strong perfect graph theorem","score":0.43853768706321716},{"id":"https://openalex.org/keywords/edge-transitive-graph","display_name":"Edge-transitive graph","score":0.4247589111328125},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4111815392971039},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.33451300859451294},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.3033324182033539},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.2550309896469116}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8810309171676636},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8674966096878052},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7779197692871094},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.6388249397277832},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.5753300786018372},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4944596290588379},{"id":"https://openalex.org/C166911692","wikidata":"https://www.wikidata.org/wiki/Q7130424","display_name":"Pancyclic graph","level":5,"score":0.46159908175468445},{"id":"https://openalex.org/C51044901","wikidata":"https://www.wikidata.org/wiki/Q16680059","display_name":"Strong perfect graph theorem","level":5,"score":0.43853768706321716},{"id":"https://openalex.org/C200597783","wikidata":"https://www.wikidata.org/wiki/Q4391289","display_name":"Edge-transitive graph","level":5,"score":0.4247589111328125},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4111815392971039},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.33451300859451294},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.3033324182033539},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.2550309896469116}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/jgt.3190060204","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190060204","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"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.6499999761581421}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1484040084","https://openalex.org/W2033447978","https://openalex.org/W4213214460"],"related_works":["https://openalex.org/W2107875203","https://openalex.org/W2385943199","https://openalex.org/W3029390739","https://openalex.org/W3166347205","https://openalex.org/W4287773996","https://openalex.org/W4280539597","https://openalex.org/W2049398763","https://openalex.org/W2617676513","https://openalex.org/W2242004526","https://openalex.org/W2062824568"],"abstract_inverted_index":{"Abstract":[0],"In":[1,43],"this":[2],"paper":[3],"are":[4,22,51],"investigated":[5],"maximum":[6,16,36,45,96],"bipartite":[7,12,37,46,97],"subgraphs":[8,13,21,47],"of":[9,18,39,48,73,77,94],"graphs,":[10],"i.e.,":[11],"with":[14],"a":[15,25,30,34,40,74,81],"number":[17],"edges.":[19],"Such":[20],"characterized":[23],"and":[24,88],"criterion":[26],"is":[27,54],"given":[28,41],"for":[29],"subgraph":[31,38],"to":[32],"be":[33,60],"unique":[35],"graph.":[42],"particular":[44],"cubic":[49,57,78],"graphs":[50,58,79],"investigated.":[52],"It":[53],"shown":[55],"that":[56],"can":[59],"built":[61],"up":[62],"from":[63],"five":[64],"building":[65],"stones":[66],"(called":[67],"elementary":[68],"paths).":[69],"Finally":[70],"the":[71,85,89],"investigation":[72],"special":[75],"class":[76],"yields":[80],"theorem":[82],"which":[83],"characterizes":[84],"Petersen":[86],"graph":[87,91],"dodecahedron":[90],"by":[92],"means":[93],"their":[95],"subgraphs.":[98]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}