{"corpus_id":49767,"paper_sha":"8498e2c0cda7224a14f00dbeeb38e0b880946782","doi":"10.1016/j.ejc.2012.03.028","arxiv_id":"1106.0420","pmid":null,"pmcid":null,"mag_id":2914210329,"dblp_id":"journals/ejc/DvorakLS12","acl_id":null,"title":"Bipartizing fullerenes","year":2011,"publication_date":"2011-06-02","venue":"European journal of combinatorics (Print)","journal":{"name":"Eur. J. Comb.","pages":"1286-1293","volume":"33"},"journal_issn":null,"journal_title":null,"publication_types":["JournalArticle"],"pubmed_pub_types":null,"s2_fields_of_study":["Mathematics","Computer Science"],"reference_count":15,"citation_count":10,"influential_citation_count":1,"is_open_access":false,"arxiv_categories":["math.CO"],"arxiv_license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","arxiv_journal_ref":null,"mesh_headings":null,"chemicals":null,"comments_corrections":null,"source_flags":1,"s2_open_access_pdf_url":null,"s2_open_access_landing_url":null,"s2_open_access_license":null,"s2_open_access_status":null,"pmc_open_access_pdf_url":null,"pmc_open_access_landing_url":null,"pmc_open_access_license":null,"pmc_open_access_status":null,"unpaywall_open_access_pdf_url":null,"unpaywall_open_access_landing_url":null,"unpaywall_open_access_license":null,"unpaywall_open_access_status":null,"abstract":"A fullerene graph is a cubic bridgeless planar graph with twelve 5-faces such that all other faces are 6-faces. We show that any fullerene graph on n vertices can be bipartized by removing O(n) edges. This bound is asymptotically optimal.","claims":[{"public_id":"cl_978522312d6e3509d9cae7b7bfbfd39d","status":"active","text":"Any fullerene graph on n vertices can be bipartized by removing O(n) edges.","confidence":0.95,"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_978522312d6e3509d9cae7b7bfbfd39d"},{"public_id":"cl_c08323a1cd8a012d6323970c94edd146","status":"active","text":"This bound is asymptotically optimal.","confidence":0.9,"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_c08323a1cd8a012d6323970c94edd146"}],"concepts":[{"public_id":"co_19ff1203f71fe69fa930c4d6cc3fa6a9","status":"active","name":"O(n) edges","description":"A number of edges to remove that scales linearly with the number of vertices n.","types":["bound","asymptotic quantity"],"aliases":[],"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_19ff1203f71fe69fa930c4d6cc3fa6a9"},{"public_id":"co_27314fde800e52dd699346adaad1528f","status":"active","name":"bipartized","description":"The process of making a graph bipartite by removing edges.","types":["operation","transformation"],"aliases":[],"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_27314fde800e52dd699346adaad1528f"},{"public_id":"co_9751ca1654c13d66e3f3ea1eeae6673e","status":"active","name":"fullerene graph","description":"A cubic bridgeless planar graph with twelve 5-faces such that all other faces are 6-faces.","types":["graph","mathematical object"],"aliases":[],"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_9751ca1654c13d66e3f3ea1eeae6673e"}],"external_ids":{"DOI":"10.1016/j.ejc.2012.03.028","ArXiv":"1106.0420","PubMed":null,"PubMedCentral":null,"MAG":2914210329,"DBLP":"journals/ejc/DvorakLS12","ACL":null},"open_access":{"is_open_access":true,"pdf_url":"https://arxiv.org/pdf/1106.0420","landing_url":"https://arxiv.org/abs/1106.0420","source":"arxiv","pdf_url_source":"derived_arxiv","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","reason":null},"reference_availability":{"status":"available","references_indexed":true,"full_text_available":true,"full_text_source":"arxiv","count_basis":"semantic_scholar_metadata","extraction_status":"not_applicable","reason":null},"source":{"provider":"episteme2","base_corpus":"semantic_scholar_dump","freshness_mode":"unknown","basis":["semantic_scholar_metadata","postgres_metadata"],"limits":["paper metadata is based on indexed upstream scholarly datasets","claims and concepts are available only for extracted papers","absence of claims or concepts means no extracted graph data is available in this response"],"status":"available","degraded":false,"degraded_reasons":[],"diagnostics":{"status":"available","degraded":false,"degraded_reasons":[],"metadata_status":"available","graph_status":"available","abstract_status":"available"},"source_flags":1},"paper_id":633434,"paper_uid":"cf70c6d1-4f7b-417d-82c8-4e61d1f7ac13","canonical_identity":{"paper_id":633434,"paper_uid":"cf70c6d1-4f7b-417d-82c8-4e61d1f7ac13","identity_status":"available","lookup_basis":"semantic_scholar_external_id","compatibility_path":"corpus_id"},"url":"https://sah.borca.ai/papers/49767"}