:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Lorenz, Nicola, Pitz, Max
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics 05C63, 05C69, 05C83
Accès en ligne:	https://arxiv.org/abs/2510.04367
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Displaying prescribed sets of ends by linked tree-decompositions
par: Albrechtsen, Sandra, et autres
Publié: (2025)

Linked tree-decompositions into finite parts
par: Albrechtsen, Sandra, et autres
Publié: (2024)

Counterexamples regarding linked and lean tree-decompositions of infinite graphs
par: Albrechtsen, Sandra, et autres
Publié: (2024)

On tree-decompositions for infinite chordal graphs
par: Pitz, Max, et autres
Publié: (2026)

On vertex sets inducing tangles
par: Albrechtsen, Sandra, et autres
Publié: (2024)

Representations of infinite tree-sets
par: Gollin, J. Pascal, et autres
Publié: (2019)

A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
par: Erde, Joshua, et autres
Publié: (2019)

A coarse Halin Grid Theorem with applications to quasi-transitive, locally finite graphs
par: Albrechtsen, Sandra, et autres
Publié: (2025)

Asymptotic half-grid and full-grid minors
par: Albrechtsen, Sandra, et autres
Publié: (2024)

Refining tree-decompositions so that they display the k-blocks
par: Albrechtsen, Sandra
Publié: (2024)

Tangle-tree duality in infinite graphs
par: Albrechtsen, Sandra
Publié: (2024)

Locally chordal graphs
par: Abrishami, Tara, et autres
Publié: (2025)

Canonical tree-decompositions of chordal graphs
par: Jacobs, Raphael W., et autres
Publié: (2025)

Graph minors and metric spaces
par: Georgakopoulos, Agelos, et autres
Publié: (2023)

The Nash-Williams orientation theorem for graphs with countably many ends
par: Assem, Amena, et autres
Publié: (2023)

On order-compatible paths in infinite graphs
par: Pitz, Max, et autres
Publié: (2026)

Treewidth versus clique number: induced minors
par: Hilaire, Claire, et autres
Publié: (2024)

The immersion-minimal infinitely edge-connected graph
par: Knappe, Paul, et autres
Publié: (2022)

The excluded minors for embeddability into a compact surface
par: Georgakopoulos, Agelos
Publié: (2023)

All graphs are majority 3-choosable
par: Ouborny, Jan, et autres
Publié: (2025)

Treewidth versus clique number. V. Further connections with tree-independence number
par: Hilaire, Claire, et autres
Publié: (2025)

The odd independence number of graphs, II: Finite and infinite grids and chessboard graphs
par: Caro, Yair, et autres
Publié: (2025)

On the number of outer connected dominating sets of graphs
par: Alikhani, Saeid, et autres
Publié: (2011)

Trees of tangles in infinite separation systems
par: Elbracht, Christian, et autres
Publié: (2020)

A metrization theorem for edge-end spaces of infinite graphs
par: Pitz, Max
Publié: (2025)

Efficiently distinguishing all tangles in locally finite graphs
par: Jacobs, Raphael W., et autres
Publié: (2023)

On better-quasi-ordering under graph minors
par: Georgakopoulos, Agelos
Publié: (2025)

Domination Polynomials of the Grid, the Cylinder, the Torus, and the King Graph
par: Mertens, Stephan
Publié: (2024)

A note on uncountably chromatic graphs
par: Bowler, Nathan, et autres
Publié: (2024)

Small counterexamples to the fat minor conjecture
par: Albrechtsen, Sandra, et autres
Publié: (2026)

Canonical graph decompositions via coverings
par: Diestel, Reinhard, et autres
Publié: (2022)

New Optimal Results on Codes for Location in Graphs
par: Junnila, Ville, et autres
Publié: (2023)

Excluding an induced wheel minor in graphs without large induced stars
par: Choi, Mujin, et autres
Publié: (2025)

Canonical graph decompositions via local separations
par: Jacobs, Raphael W., et autres
Publié: (2025)

Domination Polynomial of the Rook Graph
par: Mertens, Stephan
Publié: (2024)

Finding irrelevant vertices in linear time on bounded-genus graphs
par: Golovach, Petr A., et autres
Publié: (2019)

Distinguishing colorings, proper colorings, and covering properties without the Axiom of Choice
par: Banerjee, Amitayu, et autres
Publié: (2023)

Induced Minor Models. I. Structural Properties and Algorithmic Consequences
par: Bousquet, Nicolas, et autres
Publié: (2024)

Sets of vertices with extremal energy
par: Bushaw, Neal, et autres
Publié: (2024)

Unique paired vs edge-vertex minimum dominating sets in trees
par: Miotk, Mateusz, et autres
Publié: (2025)