On the computational complexity of the bipartizing matching problem | 0 | 0.34 | 2022 |
Zero-Sum Copies of Spanning Forests in Zero-Sum Complete Graphs | 0 | 0.34 | 2022 |
Algorithmic aspects of broadcast independence | 0 | 0.34 | 2022 |
ON HAMILTONIAN CYCLES IN CLAW-FREE CUBIC GRAPHS | 0 | 0.34 | 2022 |
Linear programming based approximation for unweighted induced matchings—Breaking the Δ barrier | 1 | 0.35 | 2020 |
Domination versus edge domination | 0 | 0.34 | 2020 |
Closed-neighborhood union-closed graphs | 0 | 0.34 | 2020 |
On the maximum number of minimum total dominating sets in forests. | 0 | 0.34 | 2019 |
Forcing brushes. | 0 | 0.34 | 2019 |
On the Kőnig-Egerváry theorem for k-paths: BESSY et al. | 0 | 0.34 | 2019 |
Approximating maximum uniquely restricted matchings in bipartite graphs | 0 | 0.34 | 2019 |
Some bounds on the zero forcing number of a graph. | 5 | 0.59 | 2018 |
On the hardness of finding the geodetic number of a subcubic graph. | 0 | 0.34 | 2018 |
Hereditary equality of domination and exponential domination. | 0 | 0.34 | 2018 |
Dynamic monopolies for interval graphs with bounded thresholds. | 1 | 0.36 | 2018 |
On some Graphs with a Unique Perfect Matching. | 0 | 0.34 | 2018 |
Approximately locating an invisible agent in a graph with relative distance queries. | 0 | 0.34 | 2018 |
Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees. | 0 | 0.34 | 2017 |
Some comments on the Slater number. | 0 | 0.34 | 2017 |
Extremal Values of the Chromatic Number for a Given Degree Sequence. | 0 | 0.34 | 2017 |
Local Connectivity, Local Degree Conditions, some Forbidden Induced Subgraphs, and Cycle Extendability | 0 | 0.34 | 2017 |
Decycling with a matching. | 2 | 0.64 | 2017 |
Relating domination, exponential domination, and porous exponential domination. | 2 | 0.47 | 2017 |
Exponential independence. | 0 | 0.34 | 2017 |
The Geodetic Hull Number is Hard for Chordal Graphs. | 2 | 0.38 | 2017 |
Bounds on the Exponential Domination Number | 3 | 0.57 | 2017 |
Corrigendum to "Complexity analysis of P3-convexity problems on bounded-degree and planar graphs" [Theoret. Comput. Sci. 607 Part 1 (2015) 83-95]. | 0 | 0.34 | 2017 |
Cycles Avoiding a Color in Colorful Graphs | 0 | 0.34 | 2016 |
Forbidden induced subgraphs for bounded p-intersection number | 0 | 0.34 | 2016 |
Largest Domination Number and Smallest Independence Number of Forests with given Degree Sequence | 1 | 0.39 | 2016 |
On the geodetic iteration number of distance-hereditary graphs | 0 | 0.34 | 2016 |
Strong Equality of Roman and Weak Roman Domination in Trees | 1 | 0.41 | 2016 |
Independence in Uniform Linear Triangle-free Hypergraphs | 0 | 0.34 | 2016 |
A lower bound on the independence number of a graph in terms of degrees and local clique sizes | 0 | 0.34 | 2016 |
Feedback vertex sets in cubic multigraphs | 4 | 0.54 | 2015 |
Brush your trees! | 1 | 0.37 | 2015 |
Equality of distance packing numbers | 0 | 0.34 | 2015 |
Distance k-domination, distance k-guarding, and distance k-vertex cover of maximal outerplanar graphs. | 4 | 0.59 | 2015 |
Robust recoverable perfect matchings | 2 | 0.41 | 2015 |
Complexity of Geodetic Number Problem in Graphs with Maximum Degree 4. | 0 | 0.34 | 2015 |
The P3-Convexity in the Complementary Prism of a Graph. | 0 | 0.34 | 2015 |
Complexity analysis of P-convexity problems on bounded-degree and planar graphs. | 1 | 0.36 | 2015 |
The Maximum Number of Dominating Induced Matchings. | 0 | 0.34 | 2015 |
Remarks on dynamic monopolies with given average thresholds. | 1 | 0.36 | 2015 |
Graphs of interval count two with a given partition | 1 | 0.36 | 2014 |
Transversals of Longest Paths and Cycles | 3 | 0.51 | 2014 |
Independent domination in subcubic bipartite graphs of girth at least six | 1 | 0.37 | 2014 |
Integral mixed unit interval graphs | 4 | 0.56 | 2013 |
Geodetic Number versus Hull Number in P3-Convexity. | 0 | 0.34 | 2013 |
Matchings in Graphs of Odd Regularity and Girth. | 1 | 0.37 | 2013 |