Cover Image

Reconstructing a graph from the distance matrix of its boundary

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cáceres, José, Pelayo, Ignacio M.
Format:	Preprint
Published:	2024
Subjects:	Combinatorics 05C12, 05C85, 68R10
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The zero blocking numbers of generalized Kneser graphs and generalized Johnson graphs
by: Lin, Hau-Yi, et al.
Published: (2025)

The zero blocking numbers of grid graphs
by: Lin, Hau-Yi, et al.
Published: (2025)

Zero blocking numbers of graphs with complexity results
by: Lin, Hau-Yi, et al.
Published: (2025)

Minimal obstructions to $C_5$-coloring in hereditary graph classes
by: Goedgebeur, Jan, et al.
Published: (2024)

Algorithmic releases on the spanning trees of suitable graphs
by: Imbesi, Maurizio, et al.
Published: (2017)

Three results towards the approximation of special maximum matchings in graphs
by: Mkrtchyan, Vahan
Published: (2024)

Quota Trees
by: White, Tad
Published: (2024)

Extremal Trees With Prescribed Burning Numbers
by: Leong, Eugene Jun Tong, et al.
Published: (2025)

Metric representations by minimal graphs
by: Franco-Sánchez, Víctor, et al.
Published: (2026)

Independent Locating-Dominating Sets in Pseudotrees
by: Cáceres, José, et al.
Published: (2026)

Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
by: Furmańczyk, Hanna, et al.
Published: (2020)

$2$-polarity and algorithmic aspects of polarity variants on cograph superclasses
by: Contreras-Mendoza, Fernando Esteban, et al.
Published: (2022)

An NP-hardness result for the colored constrained maximum 2-edge-colorable subgraph problem in bipartite graphs
by: Mkrtchyan, Vahan
Published: (2024)

Infinite families of planar graphs of a given injective chromatic number
by: Daneels, Matias, et al.
Published: (2024)

A Linear Kernel for Independent Set Reconfiguration in Planar Graphs
by: Bousquet, Nicolas, et al.
Published: (2025)

Catching Rats in $H$-minor-free Graphs
by: Gorsky, Maximilian, et al.
Published: (2025)

A Note on Graph Burning of Path Forests
by: Tan, Ta Sheng, et al.
Published: (2023)

The maximum number of connected sets in regular graphs
by: Cambie, Stijn, et al.
Published: (2023)

$(t,r)$ Broadcast Domination Numbers and Densities of the Truncated Square Tiling Graph
by: Cervantes, Jillian, et al.
Published: (2024)

Structure and algorithms for graphs excluding grids with small parity breaks as odd-minors
by: Gollin, J. Pascal, et al.
Published: (2023)

Small-scale operations on graphic sequences
by: Rusu, Irena
Published: (2026)

An efficient algorithm for generating transmission irregular trees
by: Stošić, Ivan, et al.
Published: (2025)

Improved bounds for acyclic coloring parameters
by: Kirousis, Lefteris, et al.
Published: (2022)

Perfect Edge Domination in $P_6$-free Graphs and in Graphs Without Efficient Edge Dominating Sets
by: Grippo, Luciano N., et al.
Published: (2025)

Excluding Pinched Spheres
by: Morelle, Laure, et al.
Published: (2025)

Not every graph can be reconstructed from its boundary distance matrix
by: Cáceres, José, et al.
Published: (2025)

On $γ$-Contraction and $β$-Contraction: A Unified Framework for Colour-Preserving Graph Reduction
by: Onofri, Elia
Published: (2024)

Circular-arc H-graphs: Ordering Characterizations and Forbidden Patterns
by: Paul, Indrajit, et al.
Published: (2025)

Delineating Half-Integrality of the Erdős-Pósa Property for Minors: the Case of Surfaces
by: Paul, Christophe, et al.
Published: (2024)

The Local Structure Theorem for Graph Minors with finite index
by: Paul, Christophe, et al.
Published: (2025)

The Mutual-Visibility Problem In Directed Graphs
by: Stojanović, Vanja
Published: (2026)

Maximizing the number of integer pairs summing to powers of 2 via graph labeling and solving restricted systems of linear (in)equations
by: Alekseyev, Max A.
Published: (2023)

Branch-width of represented matroids in matrix multiplication time
by: Choi, Mujin, et al.
Published: (2026)

Computational methods for finding bi-regular cages
by: Goedgebeur, Jan, et al.
Published: (2024)

Polynomial $χ$-boundedness for excluding $P_5$
by: Nguyen, Tung H.
Published: (2025)

Quickly excluding an annotated planar graph
by: Gorsky, Maximilian, et al.
Published: (2026)

Polynomial Bounds for the Graph Minor Structure Theorem
by: Gorsky, Maximilian, et al.
Published: (2025)

On algorithmic applications of sim-width and mim-width of $(H_1, H_2)$-free graphs
by: Munaro, Andrea, et al.
Published: (2022)

Obstructions to Erdős-Pósa Dualities for Minors
by: Paul, Christophe, et al.
Published: (2024)

A greedy heuristic for graph burning
by: García-Díaz, Jesús, et al.
Published: (2024)