{"id":"https://openalex.org/W2101518612","doi":"https://doi.org/10.1007/s00373-012-1188-5","title":"A Generalization of Opsut\u2019s Lower Bounds for the Competition Number of a Graph","display_name":"A Generalization of Opsut\u2019s Lower Bounds for the Competition Number of a Graph","publication_year":2012,"publication_date":"2012-05-11","ids":{"openalex":"https://openalex.org/W2101518612","doi":"https://doi.org/10.1007/s00373-012-1188-5","mag":"2101518612"},"language":"en","primary_location":{"id":"doi:10.1007/s00373-012-1188-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00373-012-1188-5","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1205.4322","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Yoshio Sano","orcid":null},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Yoshio Sano","raw_affiliation_strings":["National Institute of Informatics, Tokyo, 101-8430, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Institute of Informatics, Tokyo, 101-8430, Japan","institution_ids":["https://openalex.org/I184597095"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I184597095"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":0.6481,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.71865417,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"29","issue":"5","first_page":"1543","last_page":"1547"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.8402000069618225,"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.8402000069618225,"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.0617000013589859,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.011599999852478504,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5073999762535095},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.5037999749183655},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4702000021934509},{"id":"https://openalex.org/keywords/regular-graph","display_name":"Regular graph","score":0.4648999869823456},{"id":"https://openalex.org/keywords/complement-graph","display_name":"Complement graph","score":0.4632999897003174},{"id":"https://openalex.org/keywords/distance-regular-graph","display_name":"Distance-regular graph","score":0.4255000054836273},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.3968999981880188},{"id":"https://openalex.org/keywords/null-graph","display_name":"Null graph","score":0.39480000734329224},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.38839998841285706},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3578000068664551}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8353999853134155},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7601000070571899},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5663999915122986},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5073999762535095},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.5037999749183655},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4702000021934509},{"id":"https://openalex.org/C123482549","wikidata":"https://www.wikidata.org/wiki/Q826467","display_name":"Regular graph","level":5,"score":0.4648999869823456},{"id":"https://openalex.org/C168291704","wikidata":"https://www.wikidata.org/wiki/Q902252","display_name":"Complement graph","level":5,"score":0.4632999897003174},{"id":"https://openalex.org/C56783289","wikidata":"https://www.wikidata.org/wiki/Q3115556","display_name":"Distance-regular graph","level":5,"score":0.4255000054836273},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.3968999981880188},{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.39480000734329224},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.38839998841285706},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3578000068664551},{"id":"https://openalex.org/C121134508","wikidata":"https://www.wikidata.org/wiki/Q4949882","display_name":"Bound graph","level":5,"score":0.35659998655319214},{"id":"https://openalex.org/C148364342","wikidata":"https://www.wikidata.org/wiki/Q948887","display_name":"Wheel graph","level":5,"score":0.35409998893737793},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.3490000069141388},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.34850001335144043},{"id":"https://openalex.org/C18819970","wikidata":"https://www.wikidata.org/wiki/Q3035340","display_name":"Butterfly graph","level":5,"score":0.33340001106262207},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.32429999113082886},{"id":"https://openalex.org/C14201764","wikidata":"https://www.wikidata.org/wiki/Q1205074","display_name":"Symmetric graph","level":5,"score":0.32339999079704285},{"id":"https://openalex.org/C73380178","wikidata":"https://www.wikidata.org/wiki/Q8024306","display_name":"Windmill graph","level":5,"score":0.31850001215934753},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.3095000088214874},{"id":"https://openalex.org/C202183611","wikidata":"https://www.wikidata.org/wiki/Q7520883","display_name":"Simplex graph","level":5,"score":0.3066999912261963},{"id":"https://openalex.org/C125080357","wikidata":"https://www.wikidata.org/wiki/Q45715","display_name":"Complete graph","level":3,"score":0.29910001158714294},{"id":"https://openalex.org/C82190004","wikidata":"https://www.wikidata.org/wiki/Q5121633","display_name":"Circulant graph","level":5,"score":0.2702000141143799},{"id":"https://openalex.org/C45725084","wikidata":"https://www.wikidata.org/wiki/Q4390447","display_name":"Biconnected graph","level":5,"score":0.2623000144958496},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.25999999046325684},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.2590000033378601},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.25780001282691956},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.2524999976158142}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00373-012-1188-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00373-012-1188-5","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"},{"id":"pmh:oai:arXiv.org:1205.4322","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1205.4322","pdf_url":"https://arxiv.org/pdf/1205.4322","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1205.4322","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1205.4322","pdf_url":"https://arxiv.org/pdf/1205.4322","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5647235558","display_name":"Study on Algorithmic Graph Theory and Mathematical Optimization","funder_award_id":"25887007","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W191274146","https://openalex.org/W1966654646","https://openalex.org/W1977736648","https://openalex.org/W1980615552","https://openalex.org/W1987387008","https://openalex.org/W2010178521","https://openalex.org/W2019354841","https://openalex.org/W2046500632","https://openalex.org/W2053270673","https://openalex.org/W2058751127","https://openalex.org/W2064280346","https://openalex.org/W2090981345","https://openalex.org/W2091556347","https://openalex.org/W2139439872"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2016-06-24T00:00:00"}