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

Cites work

A Complexity Measure
Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs
Bounds on metric dimensions of graphs with edge disjoint cycles
Complexity and algorithms for isometric path cover on chordal graphs and beyond
Distance-based covering problems for graphs of given cyclomatic number
Enumerating minimal solution sets for metric graph problems
Erdös-Gallai-type problems for distance-edge-monitoring numbers
Extremal mixed metric dimension with respect to the cyclomatic number
Fixed-parameter complexity of \(\lambda\)-labelings
Geodesic Convexity in Graphs
Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications
Graphs with the edge metric dimension smaller than the metric dimension
Hardness of metric dimension in graphs of constant treewidth
scientific article; zbMATH DE number 3165195 (Why is no real title available?)
scientific article; zbMATH DE number 3758364 (Why is no real title available?)
scientific article; zbMATH DE number 3494441 (Why is no real title available?)
scientific article; zbMATH DE number 3544092 (Why is no real title available?)
scientific article; zbMATH DE number 3253072 (Why is no real title available?)
scientific article; zbMATH DE number 7650287 (Why is no real title available?)
Isometric path complexity of graphs
Landmarks in graphs
Metric dimension parameterized by max leaf number
Metric dimensions vs. cyclomatic number of graphs with minimum degree at least two
Mixed metric dimension of graphs
Mixed metric dimension of graphs with edge disjoint cycles
Monitoring edge-geodetic sets in graphs
Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity
Monitoring edge-geodetic sets: hardness and graph products
Monitoring the edges of a graph using distances
Monitoring the edges of a graph using distances
Monitoring the edges of a graph using distances with given girth
New races in parameterized algorithmics
Non-separable and planar graphs.
On a class of posets and the corresponding comparability graphs
On graphs coverable by \({k}\) shortest paths
On Path Cover Problems in Digraphs and Applications to Program Testing
On the computational complexity of the strong geodetic recognition problem
On the distance-edge-monitoring numbers of graphs
On the edge dimension of a graph
On The Edge Geodetic Number Of A Graph
Parameterized complexity of geodetic set
Parameterizing path partitions
Path covering problems and testing of printed circuits
Path Partitions in Directed Graphs
Polynomial time algorithms for tracking path problems
Problems in NP can admit double-exponential lower bounds when parameterized by treewidth or vertex cover
Reconfiguring undirected paths
Resolvability in graphs and the metric dimension of a graph
Solving NP-hard problems in 'almost trees': vertex cover
Sparsifying, shrinking and splicing for minimum path cover in parameterized linear time
Splitting a graph into disjoint induced paths or cycles.
Strong edge geodetic problem in networks
Strong geodetic problem in networks
Structural parameters, tight bounds, and approximation for \((k, r)\)-center
Structurally parameterized \(d\)-scattered set
The (weighted) metric dimension of graphs: hard and easy cases
The geodesic-transversal problem
The geodetic number of a graph
The isometric path number of a graph
The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
The neighbor-locating-chromatic number of trees and unicyclic graphs
The strong metric dimension of graphs and digraphs
Tracking paths
Two-layer planarization parameterized by feedback edge set
Uniquely identifying the edges of a graph: the edge metric dimension
Vertex and edge metric dimensions of cacti

This page was built for publication: Distance-based (and path-based) covering problems for graphs of given cyclomatic number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6972376)