Tractable connected domination for restricted bipartite graphs

Published 2014 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Tractable connected domination for restricted bipartite graphs
Authors
Keywords
Connected domination, Polynomial-time, Circular-convex bipartite graph, Triad-convex bipartite graph , Convex bipartite graph
Journal
JOURNAL OF COMBINATORIAL OPTIMIZATION
Volume 29, Issue 1, Pages 247-256
Publisher
Springer Nature
Online
2014-03-18
DOI
10.1007/s10878-014-9729-x
References
View 4 related references

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.