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
6
views
9
references
Top references
cited by
31
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,086
similar
All similar
Record
: found
Abstract
: not found
Article
: not found
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
Author(s):
Hans L Bodlaender
Publication date
Created:
December 1990
Publication date
(Print):
December 1990
Journal:
Journal of Algorithms
Publisher:
Elsevier BV
Read this article at
ScienceOpen
Publisher
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
Behavioral Public Administration
Most cited references
9
Record
: found
Abstract
: not found
Article
: not found
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
John Hopcroft
,
Richard M Karp
(1973)
0
comments
Cited
320
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
Bruno Courcelle
(1990)
0
comments
Cited
223
times
– based on
0
reviews
Review now
Bookmark
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
176
times
– based on
0
reviews
Review now
Bookmark
All references
Author and article information
Journal
Title:
Journal of Algorithms
Abbreviated Title:
Journal of Algorithms
Publisher:
Elsevier BV
ISSN (Print):
01966774
Publication date Created:
December 1990
Publication date (Print):
December 1990
Volume
: 11
Issue
: 4
Pages
: 631-643
Article
DOI:
10.1016/0196-6774(90)90013-5
SO-VID:
a28deed3-8880-4c7e-b744-1e4ecf6ca5ea
Copyright ©
© 1990
License:
http://www.elsevier.com/tdm/userlicense/1.0/
History
Data availability:
Comments
Comment on this article
Sign in to comment
scite_
Similar content
2,086
Testing isomorphism of modules
Authors:
Eugene M. Luks
,
Peter Brooksbank
The association of chromium in household dust with urinary chromium in residences adjacent to chromate production waste sites %J Environ Health Perspect
Authors:
Stern
Evaluating the Environmental Risks Associated with the Use of Chromated Copper Arsenate-Treated Wood Products in Aquatic Environments
Authors:
Kenneth Brooks
See all similar
Cited by
31
Monadic second-order evaluations on tree-decomposable graphs
Authors:
M. Mosbah
,
B. Courcelle
Definability and Descriptive Complexity on Databases of Bounded Tree-Width
Authors:
Martin Grohe
,
Julian Marino
Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs
Authors:
Dániel Marx
,
Martin Grohe
See all cited by
Most referenced authors
37
D. D. Johnson
G Johnson
N Robertson
See all reference authors