{"id":"https://openalex.org/W6891698999","doi":"https://doi.org/10.4230/lipics.cp.2025.39","title":"The 3-Decomposition Conjecture: A SAT-Based Approach with Specialized Propagators","display_name":"The 3-Decomposition Conjecture: A SAT-Based Approach with Specialized Propagators","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W6891698999","doi":"https://doi.org/10.4230/lipics.cp.2025.39"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23900","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2025.39","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol340-cp2025/LIPIcs.CP.2025.39/LIPIcs.CP.2025.39.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol340-cp2025/LIPIcs.CP.2025.39/LIPIcs.CP.2025.39.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Zhang, Tianwei","orcid":"https://orcid.org/0009-0000-3745-5234"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Zhang, Tianwei","raw_affiliation_strings":["Algorithms and Complexity Group, TU Wien, Austria"],"raw_orcid":"https://orcid.org/0009-0000-3745-5234","affiliations":[{"raw_affiliation_string":"Algorithms and Complexity Group, TU Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":null,"display_name":"Szeider, Stefan","orcid":"https://orcid.org/0000-0001-8994-1656"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Szeider, Stefan","raw_affiliation_strings":["Algorithms and Complexity Group, TU Wien, Austria"],"raw_orcid":"https://orcid.org/0000-0001-8994-1656","affiliations":[{"raw_affiliation_string":"Algorithms and Complexity Group, TU Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.38368565,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.5874000191688538,"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.5874000191688538,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.1518000066280365,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.07320000231266022,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.7778000235557556},{"id":"https://openalex.org/keywords/propagator","display_name":"Propagator","score":0.7336999773979187},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5982999801635742},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4821000099182129},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.43149998784065247},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.413100004196167},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4108999967575073}],"concepts":[{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.7778000235557556},{"id":"https://openalex.org/C104416048","wikidata":"https://www.wikidata.org/wiki/Q302518","display_name":"Propagator","level":2,"score":0.7336999773979187},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5982999801635742},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4878000020980835},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4821000099182129},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4693000018596649},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.43149998784065247},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4260999858379364},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.413100004196167},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4108999967575073},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.3944999873638153},{"id":"https://openalex.org/C96469262","wikidata":"https://www.wikidata.org/wiki/Q1324364","display_name":"Homogeneous space","level":2,"score":0.3716000020503998},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.3675999939441681},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.366100013256073},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3569999933242798},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.3431999981403351},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.29760000109672546},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.28439998626708984},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26109999418258667},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.25690001249313354}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:23900","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2025.39","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol340-cp2025/LIPIcs.CP.2025.39/LIPIcs.CP.2025.39.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.cp.2025.39","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.cp.2025.39","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23900","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2025.39","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol340-cp2025/LIPIcs.CP.2025.39/LIPIcs.CP.2025.39.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G630843984","display_name":"Logics for Computer Science Program at TU Wien","funder_award_id":"101034440","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G7842005466","display_name":null,"funder_award_id":"Horizon 2020","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W6891698999.pdf","grobid_xml":"https://content.openalex.org/works/W6891698999.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,75],"investigate":[1],"the":[2,36,49,67,87,96,103],"3-decomposition":[3],"conjecture,":[4,88],"which":[5],"states":[6],"that":[7,58,77],"every":[8],"connected":[9],"cubic":[10],"graph":[11,153],"can":[12,145],"be":[13,83],"decomposed":[14],"into":[15],"a":[16,19,24,27],"spanning":[17],"tree,":[18],"collection":[20],"of":[21,62,70,105,130],"cycles,":[22],"and":[23,109],"matching.":[25],"Using":[26],"SAT-based":[28],"approach":[29,125],"enhanced":[30],"with":[31,55,66,140],"specialized":[32,56,141],"propagators,":[33],"we":[34],"verify":[35],"conjecture":[37],"for":[38],"all":[39],"relevant":[40],"graphs":[41,78,129],"up":[42],"to":[43,86,91,128],"28":[44,131],"vertices.":[45,132],"Our":[46,99,133],"method":[47],"extends":[48],"Satisfiability":[50],"Modulo":[51],"Symmetries":[52],"(SMS)":[53],"framework":[54],"propagators":[57],"exploit":[59],"theoretical":[60],"properties":[61],"minimal":[63,68,84],"counterexamples":[64,85],"(counterexamples":[65],"number":[69],"vertices),":[71],"enabling":[72],"efficient":[73],"pruning.":[74],"demonstrate":[76],"containing":[79],"certain":[80],"substructures":[81],"cannot":[82],"allowing":[89],"us":[90],"exclude":[92],"these":[93,122],"patterns":[94],"during":[95],"search":[97],"dynamically.":[98],"experimental":[100],"results":[101],"quantify":[102],"impact":[104],"different":[106],"propagator":[107],"configurations":[108],"forbidden":[110],"subgraph":[111],"constraints":[112],"on":[113],"solving":[114,139],"efficiency,":[115],"showing":[116],"significant":[117],"performance":[118],"improvements":[119],"when":[120],"leveraging":[121],"techniques.":[123],"The":[124],"scales":[126],"effectively":[127],"work":[134],"illustrates":[135],"how":[136],"combining":[137],"SAT":[138],"constraint":[142],"propagation":[143],"techniques":[144],"successfully":[146],"address":[147],"challenging":[148],"combinatorial":[149],"problems":[150],"in":[151],"contemporary":[152],"theory.":[154]},"counts_by_year":[],"updated_date":"2026-05-19T08:33:51.333923","created_date":"2025-10-10T00:00:00"}