Canonical tree-decompositions of chordal graphs
Raphael W. Jacobs, Paul Knappe

TL;DR
This paper characterizes locally finite, connected graphs that are locally chordal using a canonical tree-decomposition into cliques, linking local properties to a global structural decomposition.
Contribution
It introduces a canonical version of Halin's characterization, ensuring the tree-decomposition into cliques is invariant under automorphisms.
Findings
A graph is r-locally chordal iff its canonical r-global structure decomposes into cliques.
Canonical tree-decompositions can be chosen to be automorphism-invariant.
The proof connects local chordality with a global clique-based decomposition.
Abstract
We show that a locally finite, connected graph is -locally chordal (that is, its -balls are chordal) if and only if the unique canonical graph-decomposition of displaying its -global structure is into cliques. Our proof relies on a canonical version of Halin's characterization of chordal locally finite graphs as those that admit a tree-decomposition into cliques: We show that such tree-decompositions can be chosen to be canonical, that is, so that they are invariant under all the graph's automorphisms.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
