Distance-based covering problems for graphs of given cyclomatic number

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Two-layer planarization parameterized by feedback edge set
The (weighted) metric dimension of graphs: hard and easy cases
Solving NP-hard problems in 'almost trees': vertex cover
The geodetic number of a graph
Resolvability in graphs and the metric dimension of a graph
Uniquely identifying the edges of a graph: the edge metric dimension
Mixed metric dimension of graphs
On the edge dimension of a graph
Path covering problems and testing of printed circuits
Mixed metric dimension of graphs with edge disjoint cycles
Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs
Metric dimensions vs. cyclomatic number of graphs with minimum degree at least two
Vertex and edge metric dimensions of cacti
Bounds on metric dimensions of graphs with edge disjoint cycles
Graphs with the edge metric dimension smaller than the metric dimension
Extremal mixed metric dimension with respect to the cyclomatic number
Strong geodetic problem in networks
Strong edge geodetic problem in networks
Landmarks in graphs
The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
The isometric path number of a graph
Geodesic Convexity in Graphs
Metric Dimension Parameterized by Max Leaf Number
On Path Cover Problems in Digraphs and Applications to Program Testing
On The Edge Geodetic Number Of A Graph
Parameterized Complexity of Geodetic Set
Monitoring the edges of a graph using distances
Monitoring edge-geodetic sets in graphs
Sparsifying, shrinking and splicing for minimum path cover in parameterized linear time
Complexity and algorithms for isometric path cover on chordal graphs and beyond

This page was built for publication: Distance-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 Q6546588)