{"id":"https://openalex.org/W6907127825","doi":"https://doi.org/10.20382/jocg.v16i1a9","title":"Flips in colorful triangulations","display_name":"Flips in colorful triangulations","publication_year":2024,"publication_date":"2024-08-08","ids":{"openalex":"https://openalex.org/W6907127825","doi":"https://doi.org/10.20382/jocg.v16i1a9"},"language":"en","primary_location":{"id":"pmh:oai:ojs.library.carleton.ca:article/4982","is_oa":true,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/4982","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"10.20382/jocg.v16i1","raw_type":"info:eu-repo/semantics/publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://jocg.org/index.php/jocg/article/view/4982","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Acharya, Rohan","orcid":"https://orcid.org/0009-0005-6313-2670"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Acharya, Rohan","raw_affiliation_strings":["University of Warwick"],"affiliations":[{"raw_affiliation_string":"University of Warwick","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":null,"display_name":"M\u00fctze, Torsten","orcid":"https://orcid.org/0000-0002-6383-7436"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"M\u00fctze, Torsten","raw_affiliation_strings":["University of Kassel and Charles University, Prague"],"affiliations":[{"raw_affiliation_string":"University of Kassel and Charles University, Prague","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"last","author":{"id":null,"display_name":"Verciani, Francesco","orcid":"https://orcid.org/0009-0000-0536-8646"},"institutions":[{"id":"https://openalex.org/I106157433","display_name":"University of Kassel","ror":"https://ror.org/04zc7p361","country_code":"DE","type":"education","lineage":["https://openalex.org/I106157433"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Verciani, Francesco","raw_affiliation_strings":["University of Kassel"],"affiliations":[{"raw_affiliation_string":"University of Kassel","institution_ids":["https://openalex.org/I106157433"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I39555362"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.59410246,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.5297999978065491,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.5297999978065491,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.226500004529953,"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.06949999928474426,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/diagonal","display_name":"Diagonal","score":0.5389000177383423},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.45210000872612},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4366999864578247},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.420199990272522},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3765000104904175},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.3547999858856201},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.34209999442100525},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.3174999952316284}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.809499979019165},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6850000023841858},{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.5389000177383423},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.45210000872612},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4366999864578247},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.420199990272522},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3765000104904175},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.3547999858856201},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.34209999442100525},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3303999900817871},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.3174999952316284},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.29760000109672546},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.2831000089645386},{"id":"https://openalex.org/C135692309","wikidata":"https://www.wikidata.org/wiki/Q111124","display_name":"Square (algebra)","level":2,"score":0.27410000562667847},{"id":"https://openalex.org/C40833965","wikidata":"https://www.wikidata.org/wiki/Q6901438","display_name":"Monochromatic color","level":2,"score":0.27379998564720154},{"id":"https://openalex.org/C178609930","wikidata":"https://www.wikidata.org/wiki/Q3538712","display_name":"Pitteway triangulation","level":3,"score":0.2662999927997589},{"id":"https://openalex.org/C7321624","wikidata":"https://www.wikidata.org/wiki/Q205","display_name":"Infinity","level":2,"score":0.25519999861717224},{"id":"https://openalex.org/C125080357","wikidata":"https://www.wikidata.org/wiki/Q45715","display_name":"Complete graph","level":3,"score":0.25360000133514404},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.25209999084472656},{"id":"https://openalex.org/C167117609","wikidata":"https://www.wikidata.org/wiki/Q17078161","display_name":"Point set triangulation","level":3,"score":0.2517000138759613}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:ojs.library.carleton.ca:article/4982","is_oa":true,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/4982","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"10.20382/jocg.v16i1","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"doi:10.20382/jocg.v16i1a9","is_oa":true,"landing_page_url":"https://doi.org/10.20382/jocg.v16i1a9","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"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":"article-journal"}],"best_oa_location":{"id":"pmh:oai:ojs.library.carleton.ca:article/4982","is_oa":true,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/4982","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"10.20382/jocg.v16i1","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,99],"associahedron":[1],"is":[2,108,214],"the":[3,42,46,69,72,163,173],"graph":[4],"$\\mathcal{G}_N$":[5,61,104,177],"that":[6,23,114,141,155,182,202,234],"has":[7,89,116],"as":[8],"nodes":[9],"all":[10,121,131,230],"triangulations":[11,22,84,107,133,146,180],"of":[12,45,57,60,71,103,162,171,176,222],"a":[13,26,54,117,125,149,186,197,217,223],"convex":[14],"$N$-gon,":[15],"and":[16,38,75,219],"an":[17,32,157,192],"edge":[18,33],"between":[19],"any":[20,142],"two":[21,36,143],"differ":[24,147],"in":[25,85,91,148,200,204,236],"flip":[27,30],"operation.":[28],"A":[29],"removes":[31],"shared":[34],"by":[35,41,63,110,128],"triangles":[37,96],"replaces":[39],"it":[40],"other":[43],"diagonal":[44],"resulting":[47,100,174],"4-gon.":[48],"In":[49,151],"this":[50],"paper,":[51],"we":[52,78,153],"consider":[53,79],"large":[55],"collection":[56],"induced":[58,101],"subgraphs":[59],"obtained":[62],"Ramsey-type":[64],"colorability":[65],"properties.":[66],"Specifically,":[67],"coloring":[68,160,183],"points":[70,90,136,165],"$N$-gon":[73],"red":[74],"blue":[76],"alternatingly,":[77],"only":[80],"colorful":[81,106,132,179],"triangulations,":[82],"namely":[83],"which":[86],"every":[87],"triangle":[88],"both":[92],"colors,":[93],"i.e.,":[94,130],"monochromatic":[95],"are":[97],"forbidden.":[98],"subgraph":[102,175],"on":[105,134,178,207,216,239],"denoted":[109],"$\\mathcal{F}_N$.":[111],"We":[112,189],"prove":[113,154],"$\\mathcal{F}_N$":[115,201],"Hamilton":[118,187,198],"cycle":[119],"for":[120,156,195,228],"$N\\geq":[122],"8$,":[123],"resolving":[124],"problem":[126],"raised":[127],"Sagan,":[129],"$N$":[135,164],"can":[137],"be":[138],"listed":[139],"so":[140],"cyclically":[144],"consecutive":[145],"flip.":[150],"fact,":[152],"arbitrary":[158],"fixed":[159],"pattern":[161],"with":[166],"at":[167],"least":[168],"10":[169],"changes":[170],"color,":[172],"(for":[181],"pattern)":[184],"admits":[185],"cycle.":[188],"also":[190],"provide":[191],"efficient":[193],"algorithm":[194,213],"computing":[196],"path":[199],"runs":[203,235],"time":[205,237],"$\\mathcal{O}(1)$":[206],"average":[208,240],"per":[209,241],"generated":[210,242],"node.":[211],"This":[212],"based":[215],"new":[218],"algorithmic":[220],"construction":[221],"tree":[224],"rotation":[225],"Gray":[226],"code":[227],"listing":[229],"$n$-vertex":[231],"$k$-ary":[232],"trees":[233],"$\\mathcal{O}(k)$":[238],"tree.":[243]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}