Cover Image

Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chakraborty, Dibyayan, Foucaud, Florent
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

$K_{2,3}$-induced minor-free graphs admit quasi-isometry with additive distortion to graphs of tree-width at most two
by: Chakraborty, Dibyayan
Published: (2025)

Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?
by: Chakraborty, Dibyayan, 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)

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

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

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

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

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

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

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

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 monitoring edge-geodetic sets in graphs
by: Foucaud, Florent, et al.
Published: (2024)

A quasi-optimal upper bound for induced paths in sparse graphs
by: Couëtoux, Basile, et al.
Published: (2025)

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

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)

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

Centered colorings in minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2024)

Weak coloring numbers of minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2024)

Adjacency labelling for proper minor-closed graph classes
by: Dujmović, Vida, et al.
Published: (2026)

Linear colorings of graphs
by: Hilaire, Claire, et al.
Published: (2025)

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

On graphs coverable by chubby shortest paths
by: Hatzel, Meike, et al.
Published: (2025)

Ramsey Goodness of paths and unbalanced graphs
by: Botler, Fábio, et al.
Published: (2024)

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

Centered colorings and weak coloring numbers in minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2026)

Neighborhood complexity of planar graphs
by: Joret, Gwenaël, et al.
Published: (2023)

On open-separating dominating codes in graphs
by: Chakraborty, Dipayan, et al.
Published: (2024)

Note on the treewidth of graphs excluding a disjoint union of cycles as a minor
by: Joret, Gwenaël, et al.
Published: (2026)

Blow-up structure of graphs excluding a tree or an apex-tree as a minor
by: Claus, Quentin, et al.
Published: (2026)

Non-empty intersection of longest paths in $H$-free graphs
by: Long Jr., James A., et al.
Published: (2023)

Strong odd colorings in graph classes of bounded expansion
by: Pilipczuk, Michał
Published: (2025)

Odd coloring graphs with linear neighborhood complexity
by: Davies, James, et al.
Published: (2025)

Weakly-sparse and strongly flip-flat classes of graphs are uniformly almost-wide
by: Ghasemi, Fatemeh, et al.
Published: (2025)

The sandwich problem for odd-hole-free and even-hole-free graphs
by: Cameron, Kathie, et al.
Published: (2024)

Asymptotic analysis and efficient random sampling of directed ordered acyclic graphs
by: Pépin, Martin, et al.
Published: (2023)