Showing 1–20 of 118 results
/ Date/ Name
Nov 12, 2022Bounding the Mostar indexFeb 18, 2022A bound on the dissociation numberMar 21, 2024Induced Subforests and SuperforestsOct 29, 2020Low Weight Perfect MatchingsSep 25, 2018Relating broadcast independence and independenceSep 19, 2018Algorithmic aspects of broadcast independenceOct 25, 2019Cubic graphs with equal independence number and matching numberApr 7, 2020Biholes in balanced bipartite graphsFeb 22, 2021Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectationFeb 12, 2018Dynamic monopolies for interval graphs with bounded thresholdsOct 1, 2014A Density Version of the Corradi-Hajnal TheoremJun 10, 2015Optimal Colorings with Rainbow PathsJul 17, 2015Strong Equality of Roman and Weak Roman Domination in TreesJul 15, 2015Forbidden Induced Subgraphs for Bounded $p$-Intersection NumberOct 29, 2015Bounds on the Exponential Domination NumberJun 15, 2023Mostar index and bounded maximum degreeFeb 2, 2022Relating dissociation, independence, and matchingsMay 2, 2018Uniquely restricted matchings in subcubic graphsDec 14, 2018Linear programming based approximation for unweighted induced matchings --- breaking the $Δ$ barrierJun 25, 2019Domination versus edge domination