{"corpus_id":127318201,"paper_sha":"2f59363eb02ba9187e85308e322a6dca6bb1c095","doi":"10.1155/S0161171283000113","arxiv_id":null,"pmid":null,"pmcid":null,"mag_id":2917692002,"dblp_id":null,"acl_id":null,"title":"Forest decompositions of graphs with cyclomatic number 2","year":1983,"publication_date":null,"venue":"","journal":{"name":"International Journal of Mathematics and Mathematical Sciences","pages":"125-136","volume":"6"},"journal_issn":null,"journal_title":null,"publication_types":[],"pubmed_pub_types":null,"s2_fields_of_study":["Mathematics"],"reference_count":2,"citation_count":1,"influential_citation_count":0,"is_open_access":true,"arxiv_categories":null,"arxiv_license":null,"arxiv_journal_ref":null,"mesh_headings":null,"chemicals":null,"comments_corrections":null,"source_flags":1,"s2_open_access_pdf_url":"https://downloads.hindawi.com/journals/ijmms/1983/202045.pdf","s2_open_access_landing_url":"https://www.semanticscholar.org/paper/2f59363eb02ba9187e85308e322a6dca6bb1c095","s2_open_access_license":"CCBY","s2_open_access_status":"GOLD","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":"The tree polynomials [1] of the basic graphs with cyclomatic number 2 are \nderived. From these polynomials, results about forest decompositions are deduced. Explicit formulae are given for the number of decompositions of the basic graphs into forest with specified finite cardinalities.","claims":[{"public_id":"cl_7541f751b8fe182f0f8f548edcd30aaa","status":"active","text":"Explicit formulae are given for the number of decompositions of the basic graphs into forests with specified finite cardinalities.","confidence":0.97,"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_7541f751b8fe182f0f8f548edcd30aaa"},{"public_id":"cl_ba8d28cdcf178caa91d1cb6b5c67cc82","status":"active","text":"Forest decomposition results are deduced from the derived tree polynomials.","confidence":0.94,"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_ba8d28cdcf178caa91d1cb6b5c67cc82"},{"public_id":"cl_e2b62c336311514595e33f7e19acabe0","status":"active","text":"Tree polynomials of the basic graphs with cyclomatic number 2 are derived.","confidence":0.98,"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_e2b62c336311514595e33f7e19acabe0"}],"concepts":[{"public_id":"co_07a6cfea5e557fd434f23cf5c95afdf6","status":"active","name":"basic graphs","description":"The class of graphs with cyclomatic number 2 considered in the paper.","types":["graph class"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_07a6cfea5e557fd434f23cf5c95afdf6"},{"public_id":"co_42cd461874f029acc02698666885876a","status":"active","name":"forest decompositions","description":"Decompositions of a graph into components that are forests.","types":["graph decomposition"],"aliases":["decompositions into forests"],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_42cd461874f029acc02698666885876a"},{"public_id":"co_50c45eaa87cdaabde04ba4734d2de1b7","status":"active","name":"specified finite cardinalities","description":"Finite prescribed sizes used to constrain the forest components in the counted decompositions.","types":["constraint"],"aliases":["finite cardinalities"],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_50c45eaa87cdaabde04ba4734d2de1b7"},{"public_id":"co_8cc2c0c87aa877af5feda07419f3fae7","status":"active","name":"cyclomatic number 2","description":"Graphs whose cyclomatic number equals 2, meaning they have two independent cycles.","types":["graph property"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_8cc2c0c87aa877af5feda07419f3fae7"},{"public_id":"co_c5ca69785e86ff5f8573f1273a259cb8","status":"active","name":"tree polynomials","description":"Polynomials associated with graphs that encode counts of spanning trees or related tree structures.","types":["mathematical object"],"aliases":["tree polynomial"],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_c5ca69785e86ff5f8573f1273a259cb8"}],"external_ids":{"DOI":"10.1155/S0161171283000113","ArXiv":null,"PubMed":null,"PubMedCentral":null,"MAG":2917692002,"DBLP":null,"ACL":null},"open_access":{"is_open_access":true,"pdf_url":"https://downloads.hindawi.com/journals/ijmms/1983/202045.pdf","landing_url":"https://www.semanticscholar.org/paper/2f59363eb02ba9187e85308e322a6dca6bb1c095","source":"semantic_scholar","pdf_url_source":"semantic_scholar_open_access_pdf","license":"CCBY","status":"GOLD","reason":null},"reference_availability":{"status":"available","references_indexed":true,"full_text_available":false,"full_text_source":null,"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":631330,"paper_uid":"abe5dde2-f2db-4585-9a66-69009a5043ba","canonical_identity":{"paper_id":631330,"paper_uid":"abe5dde2-f2db-4585-9a66-69009a5043ba","identity_status":"available","lookup_basis":"semantic_scholar_external_id","compatibility_path":"corpus_id"},"url":"https://sah.borca.ai/papers/127318201"}