Cover Image

Distance-based (and path-based) covering problems for graphs of given cyclomatic number

Fuente: arXiv

Saved in:

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

Similar Items

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

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

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

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

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

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

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)

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

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

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

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

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

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

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

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

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

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

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

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

New small regular graphs of given girth: the cage problem and beyond
by: Exoo, Geoffrey, et al.
Published: (2025)

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

Cops and robber in graphs with bounded vertex cover number
by: Bose, Prosenjit, et al.
Published: (2026)

Complexity and equivalency of multiset dimension and ID-colorings
by: Hakanen, Anni, et al.
Published: (2023)

A polynomial bound on the pathwidth of graphs edge-coverable by $k$ shortest paths
by: Baste, Julien, et al.
Published: (2025)

Tree-partitions of graphs with given pathwidth
by: Wood, David R.
Published: (2026)

Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
by: Jedličková, Nikola, et al.
Published: (2023)

Long induced paths and forbidden patterns: Polylogarithmic bounds
by: Duron, Julien, et al.
Published: (2024)

Intersecting families with covering number $3$
by: Kupavskii, Andrey
Published: (2024)

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

$θ$-free matching covered graphs
by: Joshi, Rohinee, et al.
Published: (2024)

Beyond recognizing well-covered graphs
by: Feghali, Carl, et al.
Published: (2024)

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

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

Bipartite Turán number of paths and other trees
by: Bonamy, Marthe, et al.
Published: (2025)

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

Extremal minimal bipartite matching covered graphs
by: Mallik, Amit Kumar, et al.
Published: (2024)

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

Cop numbers of periodic graphs
by: De Carufel, Jean-Lou, et al.
Published: (2023)

On the inversion number of oriented graphs
by: Bang-Jensen, Jørgen, et al.
Published: (2021)