Optimal Local Certification on Graphs of Bounded Pathwidth
We present proof labeling schemes for graphs with bounded path-width that can decide any graph property expressible in monadic second-order (MSO2) logic using O(log n)-bit vertex labels. Examples of such properties include planarity, Hamiltonicity, k-colorability H-minor-freeness, admitting a perfect matching, and having a vertex cover of a given size.
Authors
- Yi‐Jun Chang (ORCID: https://orcid.org/0000-0002-0109-2432)
- Dan Alden Baterisna
Institutions
- National University of Singapore (SG)
Publication Details
- Published
- 2025-06-13
- DOI
- https://doi.org/10.1145/3732772.3733503
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Ministry of Education - Singapore