Cover Image

Multipacking on graphs and Euclidean metric space

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Islam, Sk Samim
Format:	Preprint
Published:	2026
Subjects:	Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Multipacking and broadcast domination on cactus graph and its impact on hyperbolic graph
by: Das, Sandip, et al.
Published: (2023)

Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs
by: Das, Sandip, et al.
Published: (2023)

On the Complexity of Hop Domination and 2-Step Domination in Graph Classes
by: Das, Sandip, et al.
Published: (2026)

Parameterized complexity of $r$-Hop, $r$-Step, and $r$-Hop Roman Domination
by: Das, Sandip, et al.
Published: (2026)

Growth Rate of the Number of Empty Triangles in the Plane
by: Bhattacharya, Bhaswar B., et al.
Published: (2024)

Multipacking in Hypercubes
by: Rajendraprasad, Deepak, et al.
Published: (2025)

On the Number of Almost Empty Monochromatic Triangles
by: Bhattacharya, Bhaswar B., et al.
Published: (2026)

Multipacking in Euclidean Metric Space
by: Das, Arun Kumar, et al.
Published: (2024)

On the complexity of Multipacking
by: Das, Sandip, et al.
Published: (2026)

A Euclidean Distance Matrix Model for Convex Clustering
by: Wang, Zhaowei, et al.
Published: (2021)

Tree-layout based graph classes: proper chordal graphs
by: Paul, Christophe, et al.
Published: (2022)

Stereotype graph: A mathematical framework of category stereotypes via graph theory
by: Yan, Yijia
Published: (2025)

Euclidean Maximum Matchings in the Plane---Local to Global
by: Biniaz, Ahmad, et al.
Published: (2024)

The vertex visibility number of graphs
by: Roy, Dhanya, et al.
Published: (2025)

Enumerating minimal solution sets for metric graph problems
by: Bergougnoux, Benjamin, et al.
Published: (2023)

First-order logic axiomatization of metric graph theory
by: Chalopin, Jérémie, et al.
Published: (2022)

Throttling for metric dimension and its variants
by: Brimkov, Boris, et al.
Published: (2025)

Colourful components in $k$-caterpillars and planar graphs
by: Chlebíková, Janka, et al.
Published: (2019)

Monitoring arc-geodetic sets of oriented graphs
by: Das, Tapas, et al.
Published: (2024)

Size-varying reversible causal graph dynamics
by: Arrighi, Pablo, et al.
Published: (2018)

Fault tolerance for metric dimension and its variants
by: Geneson, Jesse, et al.
Published: (2025)

Space-time reversible graph rewriting
by: Arrighi, Pablo, et al.
Published: (2025)

On arc-density of pushably $3$-critical oriented graphs
by: Das, Tapas, et al.
Published: (2025)

Greed is slow on sparse graphs of oriented valued constraints
by: Kaznatcheev, Artem, et al.
Published: (2025)

Hamiltonicity of Schrijver graphs and stable Kneser graphs
by: Mütze, Torsten, et al.
Published: (2024)

On universal graphs for trees and treewidth $k$ graphs
by: Kaul, Neel, et al.
Published: (2025)

Determining a graph from its reconfiguration graph
by: Berthe, Gaétan, et al.
Published: (2025)

Vertex-critical graphs in co-gem-free graphs
by: Beaton, Iain, et al.
Published: (2024)

Effects of graph operations on star pairwise compatibility graphs
by: Monti, Angelo, et al.
Published: (2024)

Extended formulations for induced tree and path polytopes of chordal graphs
by: Dupont-Bouillard, Alexandre
Published: (2025)

Lower bounds for dominating set reconfiguration on sparse (directed) graphs
by: Dirks, Jona, et al.
Published: (2025)

Approximation algorithms for job scheduling with block-type conflict graphs
by: Furmańczyk, Hanna, et al.
Published: (2022)

Secure Domination in Bisplit graphs -- A Structural and algorithmic study
by: D, Swathi, et al.
Published: (2025)

Long induced paths in sparse graphs and graphs with forbidden patterns
by: Duron, Julien, et al.
Published: (2024)

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
by: Foucaud, Florent, et al.
Published: (2024)

Hitting all longest paths in $H$-free graphs and $H$-graphs
by: de Lima, Paloma T., et al.
Published: (2025)

A Fast and Effective Method for Euclidean Anticlustering: The Assignment-Based-Anticlustering Algorithm
by: Baumann, Philipp, et al.
Published: (2026)

EPPA numbers of graphs
by: Bradley-Williams, David, et al.
Published: (2023)

Diameter of the inversion graph
by: Havet, Frédéric, et al.
Published: (2024)

Colouring t-perfect graphs
by: Chudnovsky, Maria, et al.
Published: (2024)