Complexity of domination, hamiltonicity and treewidth for tree convex bipartite graphs

Title
Complexity of domination, hamiltonicity and treewidth for tree convex bipartite graphs
Authors
Keywords
<span class=InlineEquation id=IEq3>(mathcal {NP}), Domination, Hamiltonianicity, Treewidth, Tree convex bipartite graphs
Journal
JOURNAL OF COMBINATORIAL OPTIMIZATION
Volume 32, Issue 1, Pages 95-110
Publisher
Springer Nature
Online
2015-06-11
DOI
10.1007/s10878-015-9917-3

Ask authors/readers for more resources

Reprint

Contact the author

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started