Author:
Klavžar Sandi,Žerovnik Janez
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference21 articles.
1. Efficient algorithms for combinatorial problems on graphs with bounded decomposability-a survey;Arnborg;BIT,1985
2. Linear time algorithms for NP-hard problems on graphs embedded in k-trees, TRITA-NA-8404, Department of Numerical Analysis and Computer Science;Arnborg,1984
3. The matching polynomial of a polygraph;Babić;Discrete Appl. Math.,1986
4. Graphs and Networks;Carré,1979
5. The domination numbers of the 5 × n and 6 × n grid graphs;Chang;J. Graph Theory,1993
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献