ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
9
views
33
references
Top references
cited by
8
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,687
similar
All similar
Record
: found
Abstract
: not found
Article
: not found
Parameters Tied to Treewidth : PARAMETERS TIED TO TREEWIDTH
Author(s):
Daniel J. Harvey
,
David R. Wood
Publication date
Created:
April 2017
Publication date
(Print):
April 31 2017
Journal:
Journal of Graph Theory
Publisher:
Wiley-Blackwell
Read this article at
ScienceOpen
Publisher
Further versions
Review
Review article
Invite someone to review
Bookmark
Cite as...
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
ScienceOpen Research
Most cited references
33
Record
: found
Abstract
: not found
Article
: not found
Graph minors. II. Algorithmic aspects of tree-width
Neil Robertson
,
P.D Seymour
(1986)
0
comments
Cited
217
times
– based on
0
reviews
Review now
Record
: found
Abstract
: not found
Article
: not found
Complexity of Finding Embeddings in a k-Tree
Stefan Arnborg
,
Derek G. Corneil
,
Andrzej Proskurowski
(1987)
0
comments
Cited
180
times
– based on
0
reviews
Review now
Record
: found
Abstract
: not found
Article
: not found
Incidence matrices and interval graphs
Delbert Fulkerson
,
Oliver Gross
(1965)
0
comments
Cited
173
times
– based on
0
reviews
Review now
All references
Author and article information
Journal
Title:
Journal of Graph Theory
Abbreviated Title:
J. Graph Theory
Publisher:
Wiley-Blackwell
ISSN:
03649024
Publication date Created:
April 2017
Publication date (Print):
April 31 2017
Volume
: 84
Issue
: 4
Pages
: 364-385
Article
DOI:
10.1002/jgt.22030
SO-VID:
330b8579-e845-42f4-8f4b-63ab68422554
Copyright ©
© 2017
License:
http://doi.wiley.com/10.1002/tdm_license_1
History
Data availability:
Comments
Comment on this article
Sign in to comment
Related Documents Log
scite_
Similar content
1,687
Parameterized Complexity of Chordal Conversion for Sparse Semidefinite Programs with Small Treewidth
Authors:
Richard Y. Zhang
Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover
Authors:
Jiří Fiala
,
Petr A. Golovach
,
Jan Kratochvíl
The size Ramsey number of graphs with bounded treewidth
Authors:
Nina Kamčev
,
Anita Liebenau
,
David Wood
…
See all similar
Cited by
8
Track Layouts, Layered Path Decompositions, and Leveled Planarity
Authors:
Michael Bannister
,
William Devanny
,
Vida Dujmović
…
Orthogonal Tree Decompositions of Graphs
Authors:
Vida Dujmović
,
Gwenaël Joret
,
Pat Morin
…
The size Ramsey number of graphs with bounded treewidth
Authors:
Nina Kamčev
,
Anita Liebenau
,
David Wood
…
See all cited by
Most referenced authors
129
R Thomas
R Lipton
T Jensen
See all reference authors