Dominating induced matchings in graphs containing no long claw

Dominating induced matchings in graphs containing no long claw An induced matching M in a graph G is dominating if every edge not in M shares exactly one vertex with an edge in M. The dominating induced matching problem (also known as efficient edge domination) asks whether a graph G contains a dominating induced matching. This problem is generally NP‐complete, but polynomial‐time solvable for graphs with some special properties. In particular, it is solvable in polynomial time for claw‐free graphs. In the present article, we provide a polynomial‐time algorithm to solve the dominating induced matching problem for graphs containing no long claw, that is, no induced subgraph obtained from the claw by subdividing each of its edges exactly once. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Graph Theory Wiley

Dominating induced matchings in graphs containing no long claw

Loading next page...
 
/lp/wiley/dominating-induced-matchings-in-graphs-containing-no-long-claw-uRUhTEefYP
Publisher
Wiley Subscription Services, Inc., A Wiley Company
Copyright
Copyright © 2018 Wiley Periodicals, Inc.
ISSN
0364-9024
eISSN
1097-0118
D.O.I.
10.1002/jgt.22182
Publisher site
See Article on Publisher Site

Abstract

An induced matching M in a graph G is dominating if every edge not in M shares exactly one vertex with an edge in M. The dominating induced matching problem (also known as efficient edge domination) asks whether a graph G contains a dominating induced matching. This problem is generally NP‐complete, but polynomial‐time solvable for graphs with some special properties. In particular, it is solvable in polynomial time for claw‐free graphs. In the present article, we provide a polynomial‐time algorithm to solve the dominating induced matching problem for graphs containing no long claw, that is, no induced subgraph obtained from the claw by subdividing each of its edges exactly once.

Journal

Journal of Graph TheoryWiley

Published: Jan 1, 2018

Keywords: ; ;

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off