Results 21 to 30 of about 60,217 (209)
Exact Algorithms for Minimum Weighted Dominating Induced Matching
Algorithmica, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lin, Min Chih +2 more
openaire +3 more sources
Between Treewidth and Clique-width [PDF]
, 2014 Many hard graph problems can be solved efficiently when restricted to graphs of bounded treewidth, and more generally to graphs of bounded clique-width.
B Courcelle +12 more
core +1 more source
Γ -Paired dominating graphs of some paths
MATEC Web of Conferences, 2018 A paired dominating set of a graph G = (V(G),E(G)) is a set D of vertices of G such that every vertex is adjacent to some vertex in D, and the subgraph of G induced by D contains a perfect matching. The upper paired domination number of G, denoted by Γpr(
Eakawinrujee Pannawat +1 more
doaj +1 more source
Fast algorithms for some dominating induced matching problems
Information Processing Letters, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Min Chih Lin +2 more
openaire +3 more sources
Exact algorithms for dominating induced matching based on graph partition
Discrete Applied Mathematics, 2015 A dominating induced matching, also called an efficient edge domination, of a graph $G=(V,E)$ with $n=|V|$ vertices and $m=|E|$ edges is a subset $F \subseteq E$ of edges in the graph such that no two edges in $F$ share a common endpoint and each edge in $E\setminus F$ is incident with exactly one edge in $F$.
Mingyu Xiao, Hiroshi Nagamochi
openaire +2 more sources
On the dominating induced matching problem: Spectral results and sharp bounds
Discrete Applied Mathematics, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Enide Andrade +3 more
openaire +3 more sources
Circumferences of 3-connected claw-free graphs, II [PDF]
, 2016 For a graph H , the circumference of H , denoted by c ( H ) , is the length of a longest cycle in H . It is proved in Chen (2016) that if H is a 3-connected claw-free graph of order n with δ ≥ 8 , then c ( H ) ≥ min { 9 δ − 3 , n } .
Chen, Zhi-Hong
core +2 more sources
Exact algorithms for dominating induced matchings
, 2013 9 ...
Lin, Min Chih +2 more
openaire +2 more sources
Dominating induced matchings in graphs without a skew star
Journal of Discrete Algorithms, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Korpelainen, Nicholas +2 more
openaire +2 more sources
Dominating Sets and Induced Matchings in Orthogonal Ray Graphs
IEICE Transactions on Information and Systems, 2014 SUMMARY An orthogonal ray graph is an intersection graph of horizontal and vertical rays (closed half-lines) in the plane. Such a graph is 3-directional if every vertical ray has the same direction, and 2-directional if every vertical ray has the same direction and every horizontal ray has the same direction.
Asahi Takaoka +2 more
openaire +2 more sources