Finding minimal forbidden minors using a finite congruence-Reference-Cited by-同舟云学术

Finding minimal forbidden minors using a finite congruence

Published:1991 Issue: Volume: Page:532-543
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Lagergren Jens,Arnborg Stefan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-54233-7_161

Reference9 articles.

1. S. Arnborg, D.G. Corneil, and A. Proskurowski. Complexity of finding embeddings in a k-tree. SIAM J. Alg. and Discr. Methods, 8:277–284, 1987.

2. S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese. An algebraic theory of graph reduction. Technical Report LaBRI-90-02, Universite de Bordeaux, Jan. 1990.

3. S. Arnborg, A. Proskurowski, and D. Seese. Monadic second order logic, tree automata and forbidden minors. Manuscript, 1990.

4. M. Bauderon and B. Courcelle. Graph expressions and graph rewritings. Mathematical Systems Theory, 20:83–127, 1987.

5. J.A. Bondy and U.S.R. Murty. Graph Theory with Applications. North-Holland, 1979.

Cited by 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Improved Parameterized Algorithm for Treewidth;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

2. Typical Sequences Revisited — Computing Width Parameters of Graphs;Theory of Computing Systems;2021-03-26

3. Computing Tree Decompositions;Treewidth, Kernels, and Algorithms;2020

4. Myhill–Nerode Methods for Hypergraphs;Algorithmica;2015-02-26

5. Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization;SIAM Journal on Discrete Mathematics;2013-01