Cover Image

Infinite graphs with finite metric dimension

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Biró, Csaba, Boone, Caroline E., Novick, Beth, Torek, Hazel
Format:	Preprint
Published:	2026
Subjects:	Combinatorics 05C63
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Infinite random graphs
by: Kostana, Ziemowit, et al.
Published: (2026)

On adjacency operators of locally finite graphs
by: Trofimov, Vladimir I.
Published: (2022)

Chip-Firing on Infinite $k$-ary Trees
by: Agrawal, Dillan, et al.
Published: (2025)

Unavoidable Induced Subgraph of Infinite 2-connected Graphs
by: Allred, Sarah, et al.
Published: (2022)

The Erdős-Pósa property for infinite graphs
by: Krill, Thilo
Published: (2024)

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

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

Infinite grids in digraphs
by: Hamann, Matthias, et al.
Published: (2024)

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

Distinguishing regular graphs from lists
by: Kwaśny, Jakub, et al.
Published: (2022)

Trivial coloring of Cartesian product of graphs
by: Csernák, Tamás
Published: (2023)

On a problem concerning integer distance graphs
by: Oravcová, Janka, et al.
Published: (2024)

On the Possibilities of Defining Infinite Oriented Matroids
by: Bowler, Nathan, et al.
Published: (2026)

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

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

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

Packing independent cliques into planar graphs
by: Biró, Csaba, et al.
Published: (2024)

Brooks' type theorems for coloring parameters of locally finite graphs and Konig's Lemma
by: Banerjee, Amitayu, et al.
Published: (2024)

Edge-ends versus topological ends of graphs
by: Aurichi, Leandro, et al.
Published: (2026)

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

Efficiently distinguishing all tangles in locally finite graphs
by: Jacobs, Raphael W., et al.
Published: (2023)

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

On tree-decompositions for infinite chordal graphs
by: Pitz, Max, et al.
Published: (2026)

Remarks on the countable case of the Unfriendly Partition Problem
by: Aurichi, Leandro Fiorini, et al.
Published: (2024)

Adversarial graph burning densities
by: Gunderson, Karen, et al.
Published: (2022)

Universal families of rayless graphs
by: Aurichi, Leandro Fiorini, et al.
Published: (2025)

The classification of homomorphism homogeneous oriented graphs
by: Pavlica, Bojana, et al.
Published: (2024)

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

Menger's theorem for ends of digraphs
by: Reich, Florian
Published: (2026)

On ubiquity problems in infinite digraphs
by: Hamann, Matthias, et al.
Published: (2026)

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

An end degree for digraphs
by: Hamann, Matthias, et al.
Published: (2024)

Normal trees of digraphs
by: Reich, Florian
Published: (2024)

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

Halin's grid theorem for digraphs
by: Reich, Florian
Published: (2024)

Ubiquity of oriented rays
by: Gut, Florian, et al.
Published: (2022)

On the ubiquity of oriented double rays
by: Gut, Florian, et al.
Published: (2023)

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

A representation theorem for end spaces of infinite graphs
by: Kurkofka, Jan, et al.
Published: (2021)

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