:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Dev, Subhadeep R., Dey, Sanjana, Foucaud, Florent, Narayanan, Krishna, Sulochana, Lekshmi Ramasubramony
Format:	Preprint
Published:	2022
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2210.03774
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Characterizing optimal monitoring edge-geodetic sets for some structured graph classes
by: Foucaud, Florent, et al.
Published: (2025)

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

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

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

Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations
by: Chakraborty, Dibyayan, et al.
Published: (2025)

Strengthening the Murty-Simon conjecture on diameter 2 critical graphs
by: Dailly, Antoine, et al.
Published: (2018)

$k$-edge geodetic graphs
by: Guragain, Satyam, et al.
Published: (2024)

Distance-based (and path-based) covering problems for graphs of given cyclomatic number
by: Chakraborty, Dibyayan, et al.
Published: (2025)

Identifying open codes in trees and 4-cycle-free graphs of given maximum degree
by: Chakraborty, Dipayan, et al.
Published: (2024)

Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
by: Beaudou, Laurent, et al.
Published: (2025)

On three domination-based identification problems in block graphs
by: Chakraborty, Dipayan, et al.
Published: (2018)

Isometric path complexity of graphs
by: Chakraborty, Dibyayan, et al.
Published: (2022)

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

On graphs coverable by k shortest paths
by: Dumas, Maël, et al.
Published: (2022)

Locating-dominating partitions for some classes of graphs
by: Foucaud, Florent, et al.
Published: (2025)

On locating and neighbor-locating colorings of sparse graphs
by: Chakraborty, Dipayan, et al.
Published: (2023)

Extremal digraphs for open neighbourhood location-domination and identifying codes
by: Foucaud, Florent, et al.
Published: (2023)

Algorithms and hardness for Metric Dimension on digraphs
by: Dailly, Antoine, et al.
Published: (2023)

Identifying codes in triangle-free graphs of bounded maximum degree
by: Chakraborty, Dipayan, et al.
Published: (2024)

Progress towards the two-thirds conjecture on locating-total dominating sets
by: Chakraborty, Dipayan, et al.
Published: (2022)

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

Bounds for the local properties problem for difference sets
by: Das, Sanjana
Published: (2023)

Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
by: Beaudou, Laurent, et al.
Published: (2021)

Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?
by: Chakraborty, Dibyayan, et al.
Published: (2024)

Exponents in the local properties problem for difference sets have a gap at 2
by: Das, Sanjana
Published: (2025)

Expanding polynomials for sets with additive structure
by: Das, Sanjana, et al.
Published: (2024)

On the strong geodeticity in the corona type product of graphs
by: Sonar, Bishal, et al.
Published: (2024)

Impartial geodetic building games on graphs
by: Benesh, Bret J., et al.
Published: (2023)

Parameterized complexity of isometric path partition: treewidth and diameter
by: Chakraborty, Dibyayan, et al.
Published: (2025)

Independent mutual-visibility sets and distance edge-critical graphs
by: Tian, Jing, et al.
Published: (2026)

Locating-dominating coalitions in graphs
by: Chellali, M., et al.
Published: (2026)

The Parameterized Complexity of Computing the VC-Dimension
by: Foucaud, Florent, et al.
Published: (2025)

A note on the exact partition polytope of Frieze and Teng
by: Narayanan, Krishna, et al.
Published: (2026)

On $t$-edge-balanced graphs
by: Chee, Yeow Meng
Published: (2026)

Incidence-free sets and edge domination in incidence graphs
by: Spiro, Sam, et al.
Published: (2022)

On the number of connected edge cover sets in a graph
by: Zare, Mahsa, et al.
Published: (2024)

Weakly modular graphs with diamond condition, the interval function and axiomatic characterizations
by: Kamalolbhavan-Sheela, Lekshmi Kamal, et al.
Published: (2024)

Critical edge sets in vertex-critical graphs
by: Skottova, Ema, et al.
Published: (2025)

$t$-tone edge coloring of graphs
by: Bazzal, Hadeel Al
Published: (2026)

Saturation of edge-ordered graphs
by: Bošković, Vladimir, et al.
Published: (2024)