Author:
Godlin Benny,Kotek Tomer,Makowsky Johann A.
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Arratia, R., Bollobás, B., Sorkin, G.B.: The interlace polynomial of a graph. Journal of Combinatorial Theory, Series B 92, 199–233 (2004)
2. Biggs, N.: Algebraic Graph Theory, 2nd edn. Cambridge University Press, Cambridge (1993)
3. Bollobás, B.: Modern Graph Theory. Springer, Heidelberg (1999)
4. Courcelle, B., Olariu, S.: Upper bounds to the clique–width of graphs. Discrete Applied Mathematics 101, 77–114 (2000)
5. Courcelle, B.: A multivariate interlace polynomial and its computation for graphs of bouded clique-width. Electronic Journal of Combinatorics 15(1), R69 (2008)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fast FPT-Approximation of Branchwidth;SIAM Journal on Computing;2024-08-08
2. Fast FPT-approximation of branchwidth;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
3. A logician's view of graph polynomials;Annals of Pure and Applied Logic;2019-09
4. Clique-width III;ACM Transactions on Algorithms;2019-01-31
5. Harmonious colourings of graphs;Discrete Applied Mathematics;2017-01