Cover Image

On tree-decompositions for infinite chordal graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Pitz, Max, Real, Lucas, Schaut, Roman
Format:	Preprint
Published:	2026
Subjects:	Combinatorics 05C63, 05C40, 05C62, 05C69
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On order-compatible paths in infinite graphs
by: Pitz, Max, et al.
Published: (2026)

Displaying prescribed sets of ends by linked tree-decompositions
by: Albrechtsen, Sandra, et al.
Published: (2025)

Counterexamples regarding linked and lean tree-decompositions of infinite graphs
by: Albrechtsen, Sandra, et al.
Published: (2024)

Canonical tree-decompositions of chordal graphs
by: Jacobs, Raphael W., et al.
Published: (2025)

A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
by: Erde, Joshua, et al.
Published: (2019)

Linked tree-decompositions into finite parts
by: Albrechtsen, Sandra, et al.
Published: (2024)

Obstructions for normally spanned sets of vertices
by: Lorenz, Nicola, et al.
Published: (2025)

The Nash-Williams orientation theorem for graphs with countably many ends
by: Assem, Amena, et al.
Published: (2023)

Locally chordal graphs
by: Abrishami, Tara, et al.
Published: (2025)

Tangle-tree duality in infinite graphs
by: Albrechtsen, Sandra
Published: (2024)

The sharp upper bounds on the maximum degree and vertex-connectivity of claw-free 1-planar graphs
by: Zhang, Licheng, et al.
Published: (2025)

A metrization theorem for edge-end spaces of infinite graphs
by: Pitz, Max
Published: (2025)

The odd independence number of graphs, II: Finite and infinite grids and chessboard graphs
by: Caro, Yair, et al.
Published: (2025)

Refining tree-decompositions so that they display the k-blocks
by: Albrechtsen, Sandra
Published: (2024)

Minimal toughness in subclasses of weakly chordal graphs
by: Gollin, J. Pascal, et al.
Published: (2026)

The immersion-minimal infinitely edge-connected graph
by: Knappe, Paul, et al.
Published: (2022)

A topological characterization of end space of infinite graphs via games, subspaces and products
by: Aurichi, Leandro, et al.
Published: (2026)

A star-comb lemma for infinite digraphs
by: Reich, Florian
Published: (2024)

Large flames in rooted acyclic digraphs without backward-infinite paths
by: Joó, Attila, et al.
Published: (2025)

All graphs are majority 3-choosable
by: Ouborny, Jan, et al.
Published: (2025)

Connectoids II: existence of normal trees
by: Bowler, Nathan, et al.
Published: (2024)

Sparse graphs with an independent or foresty minimum vertex cut
by: Cheng, Kun, et al.
Published: (2024)

Identifying codes in graphs of given maximum degree: Characterizing trees
by: Chakraborty, Dipayan, et al.
Published: (2024)

Representations of infinite tree-sets
by: Gollin, J. Pascal, et al.
Published: (2019)

Twin-width of graphs with tree-structured decompositions
by: Heinrich, Irene, et al.
Published: (2023)

Canonical graph decompositions via coverings
by: Diestel, Reinhard, et al.
Published: (2022)

A coarse Halin Grid Theorem with applications to quasi-transitive, locally finite graphs
by: Albrechtsen, Sandra, et al.
Published: (2025)

Circuits through prescribed edges
by: Knappe, Paul, et al.
Published: (2018)

Extending graph total colorings to cell complexes
by: Dejter, Italo J.
Published: (2026)

On vertex sets inducing tangles
by: Albrechtsen, Sandra, et al.
Published: (2024)

Circle graphs and the automorphism group of the circle
by: Georgakopoulos, Agelos
Published: (2025)

The complex of $r$-co-connected subgraphs, chordality and Fröberg's theorem
by: Deshpande, Priyavrat, et al.
Published: (2025)

Induced matching vs edge open packing: trees and product graphs
by: Bresar, Bostjan, et al.
Published: (2024)

Connectoids I: a universal end space theory
by: Bowler, Nathan, et al.
Published: (2024)

A note on uncountably chromatic graphs
by: Bowler, Nathan, et al.
Published: (2024)

Canonical graph decompositions via local separations
by: Jacobs, Raphael W., et al.
Published: (2025)

Bounded diameter tree-decompositions
by: Berger, Eli, et al.
Published: (2023)

Representing distance-hereditary graphs with multi-rooted trees
by: Scholz, Guillaume E.
Published: (2025)

Common neighbours in planar graphs
by: Maffucci, Riccardo W.
Published: (2025)

A generalization of an ear decomposition and k-trees in highly connected star-free graphs
by: Maezawa, Shun-ichi, et al.
Published: (2025)