{"id":"https://openalex.org/W3092225056","doi":"https://doi.org/10.1142/s1793830921500336","title":"On the basis pair graphs of signed-graphic matroids","display_name":"On the basis pair graphs of signed-graphic matroids","publication_year":2020,"publication_date":"2020-10-06","ids":{"openalex":"https://openalex.org/W3092225056","doi":"https://doi.org/10.1142/s1793830921500336","mag":"3092225056"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830921500336","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830921500336","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","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/A5073955515","display_name":"Konstantinos Papalamprou","orcid":"https://orcid.org/0000-0003-2090-3365"},"institutions":[{"id":"https://openalex.org/I21370196","display_name":"Aristotle University of Thessaloniki","ror":"https://ror.org/02j61yw88","country_code":"GR","type":"education","lineage":["https://openalex.org/I21370196"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Konstantinos Papalamprou","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Aristotle University of Thessaloniki, Thessaloniki 54124, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Aristotle University of Thessaloniki, Thessaloniki 54124, Greece","institution_ids":["https://openalex.org/I21370196"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5073955515"],"corresponding_institution_ids":["https://openalex.org/I21370196"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16159532,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"13","issue":"04","first_page":"2150033","last_page":"2150033"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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.9993000030517578,"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.9987000226974487,"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/matroid","display_name":"Matroid","score":0.9569517374038696},{"id":"https://openalex.org/keywords/social-connectedness","display_name":"Social connectedness","score":0.8048510551452637},{"id":"https://openalex.org/keywords/graphic-matroid","display_name":"Graphic matroid","score":0.691777229309082},{"id":"https://openalex.org/keywords/dual-polyhedron","display_name":"Dual polyhedron","score":0.680099606513977},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.6624531745910645},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6564744114875793},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5591322779655457},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5506368279457092},{"id":"https://openalex.org/keywords/dual-graph","display_name":"Dual graph","score":0.4508216679096222},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4172568917274475},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39503389596939087},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3649749159812927},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.15443530678749084},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10655736923217773},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06728518009185791},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.06320133805274963}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.9569517374038696},{"id":"https://openalex.org/C201943243","wikidata":"https://www.wikidata.org/wiki/Q7551008","display_name":"Social connectedness","level":2,"score":0.8048510551452637},{"id":"https://openalex.org/C111034964","wikidata":"https://www.wikidata.org/wiki/Q5597156","display_name":"Graphic matroid","level":3,"score":0.691777229309082},{"id":"https://openalex.org/C105313907","wikidata":"https://www.wikidata.org/wiki/Q1053857","display_name":"Dual polyhedron","level":2,"score":0.680099606513977},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.6624531745910645},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6564744114875793},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5591322779655457},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5506368279457092},{"id":"https://openalex.org/C169827030","wikidata":"https://www.wikidata.org/wiki/Q2294516","display_name":"Dual graph","level":4,"score":0.4508216679096222},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4172568917274475},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39503389596939087},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3649749159812927},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15443530678749084},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10655736923217773},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06728518009185791},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.06320133805274963},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830921500336","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830921500336","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","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":8,"referenced_works":["https://openalex.org/W1874418509","https://openalex.org/W1972083652","https://openalex.org/W1976530820","https://openalex.org/W2040101882","https://openalex.org/W2045043408","https://openalex.org/W2095242595","https://openalex.org/W3039948875","https://openalex.org/W4210751359"],"related_works":["https://openalex.org/W2550106438","https://openalex.org/W3165795633","https://openalex.org/W146649319","https://openalex.org/W2106412416","https://openalex.org/W802746881","https://openalex.org/W2325477667","https://openalex.org/W2072414647","https://openalex.org/W2494200571","https://openalex.org/W1965245944","https://openalex.org/W4297571003"],"abstract_inverted_index":{"There":[0],"is":[1],"a":[2],"long-standing":[3],"conjecture":[4],"being":[5],"open":[6],"for":[7,25,60],"decades":[8],"regarding":[9],"the":[10,13,26,56,61],"connectedness":[11,58],"of":[12,17,28,64],"basis":[14,48],"pair":[15,49],"graphs":[16],"matroids.":[18],"In":[19],"this":[20],"work":[21],"we":[22],"provide":[23],"results":[24],"class":[27,63],"signed-graphic":[29,35,65],"matroids":[30,36,40,66],"and":[31,70],"their":[32],"duals.":[33],"Specifically,":[34],"having":[37],"no":[38],"particular":[39],"as":[41],"minors":[42],"are":[43,75],"proven":[44],"to":[45],"have":[46,67],"connected":[47],"graphs.":[50],"The":[51],"main":[52],"obstacles":[53],"in":[54],"proving":[55],"aforementioned":[57],"result":[59],"whole":[62],"been":[68],"identified":[69],"approaches":[71],"on":[72],"overcoming":[73],"them":[74],"proposed.":[76]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}