{"id":"https://openalex.org/W7160627332","doi":"https://doi.org/10.48550/arxiv.2605.06616","title":"Adjacency labelling for proper minor-closed graph classes","display_name":"Adjacency labelling for proper minor-closed graph classes","publication_year":2026,"publication_date":"2026-05-07","ids":{"openalex":"https://openalex.org/W7160627332","doi":"https://doi.org/10.48550/arxiv.2605.06616"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.06616","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.06616","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.06616","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135709328","display_name":"Vida Dujmovi\u0107","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dujmovi\u0107, Vida","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Gavoille, Cyril","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gavoille, Cyril","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135684607","display_name":"Gwena\u00ebl Joret","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Joret, Gwena\u00ebl","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135642011","display_name":"Piotr Micek","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Micek, Piotr","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135687357","display_name":"Pat Morin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Morin, Pat","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5135650658","display_name":"David R. Wood","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wood, David R.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.6072999835014343,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.6072999835014343,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.22630000114440918,"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.10379999876022339,"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/adjacency-list","display_name":"Adjacency list","score":0.6794000267982483},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5410000085830688},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.42149999737739563},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.40400001406669617},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4020000100135803},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.382099986076355},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.3481999933719635},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.3140000104904175},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.31360000371932983}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8070999979972839},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.6794000267982483},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6710000038146973},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.590499997138977},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5410000085830688},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.42149999737739563},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.40400001406669617},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4020000100135803},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.382099986076355},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.3481999933719635},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.3140000104904175},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.31360000371932983},{"id":"https://openalex.org/C2780523633","wikidata":"https://www.wikidata.org/wiki/Q380709","display_name":"Labelling","level":2,"score":0.30869999527931213},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.3012999892234802},{"id":"https://openalex.org/C123482549","wikidata":"https://www.wikidata.org/wiki/Q826467","display_name":"Regular graph","level":5,"score":0.28610000014305115},{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.2808000147342682},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.2743000090122223},{"id":"https://openalex.org/C168291704","wikidata":"https://www.wikidata.org/wiki/Q902252","display_name":"Complement graph","level":5,"score":0.27219998836517334},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.2669999897480011},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2639999985694885},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2612000107765198},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.26019999384880066},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.2547999918460846},{"id":"https://openalex.org/C56783289","wikidata":"https://www.wikidata.org/wiki/Q3115556","display_name":"Distance-regular graph","level":5,"score":0.25440001487731934}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.06616","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.06616","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.06616","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.06616","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.43078842759132385}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2,35,86],"every":[3,18,24,36],"proper":[4,19,77],"minor-closed":[5,20,78],"class":[6,21],"of":[7,47],"graphs":[8,66],"admits":[9],"a":[10],"$(1+o(1))\\log_2":[11],"n$-bit":[12],"adjacency":[13],"labelling":[14],"scheme.":[15],"Equivalently,":[16],"for":[17,64],"$\\mathcal{G}$":[22,40],"and":[23,67,88,94],"positive":[25],"integer":[26],"$n$":[27],"there":[28],"exists":[29],"an":[30,44],"$n^{1+o(1)}$-vertex":[31],"graph":[32,38],"$U$":[33],"such":[34],"$n$-vertex":[37],"in":[39,85],"is":[41],"isomorphic":[42],"to":[43,54,75],"induced":[45],"subgraph":[46],"$U$.":[48],"Both":[49],"results":[50,63],"are":[51],"optimal":[52],"up":[53],"the":[55,61,81],"lower":[56],"order":[57],"term.":[58],"They":[59],"generalize":[60],"corresponding":[62],"planar":[65],"apex-minor-free":[68],"classes":[69],"(Dujmovi\u0107":[70],"et":[71],"al.,":[72],"J.~ACM":[73],"2021)":[74],"all":[76],"classes,":[79],"answering":[80],"open":[82],"question":[83],"raised":[84],"paper":[87],"anticipated":[89],"earlier":[90],"by":[91],"Bonamy,":[92],"Gavoille,":[93],"Pilipczuk":[95],"(SODA":[96],"2020).":[97]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-09T00:00:00"}