Algebraic approach to fasciagraphs and rotagraphs

Discrete Applied Mathematics

Volumn 68, Issue 1-2, 1996, Pages 93-100

  Klavžar, Sandi ^a   Žerovnik, Janez ^b  

^a UNIVERSITY OF MARIBOR   (Slovenia)

^b INSTITUTE OF MATHEMATICS   (Slovenia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0009883801     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(95)00058-Y     Document Type: Article

References (21)

1. S. Arnborg, Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey, BIT 25 (1985) 2-23.
2. S. Arnborg and A. Proskurowski, Linear time algorithms for NP-hard problems on graphs embedded in k-trees, TRITA-NA-8404, Department of Numerical Analysis and Computer Science, Royal Institute of Technology, Stockholm, Sweden (1984).
3. D. Babić, A. Graovac, B. Mohar and T. Pisanski, The matching polynomial of a polygraph, Discrete Appl. Math. 15 (1986) 11-24.
4. B. Carré, Graphs and Networks (Clarendon Press, Oxford, 1979).
5. T.Y. Chang and W.E. Clark, The domination numbers of the 5 × n and 6 × n grid graphs, J. Graph Theory 17 (1993) 81-107.
6. B.N. Clark, C.J. Colboum and D.S. Johnson, Unit disc graphs, Discrete Math. 86 (1990) 165-177.
7. E.J. Cockayne, E.O. Hare, S.T. Hedetniemi and T.V. Wimer, Bounds for the domination number of grid graphs, Congr. Numer. 47 (1985) 217-228.
8. I. Gutman, N. Kolaković, A. Graovac and D. Babić, A method for calculation of the Hosoya index of polymers, in: A. Graovac, ed., Studies in Physical and Theoretical Chemistry,
9. E.O. Hare, S.T. Hedetniemi and W.R. Hare, Algorithms for computing the domination number of k × n complete grid graphs, Congr. Numer. 55 (1986) 81-92.
10. S.T. Hedetniemi and R.C. Laskar, Introduction, Discrete Math. 86 (1990) 3-9.
11. M.S. Jacobson and L.F. Kinch, On the domination number of products of graphs: I, Ars Combin. 18 (1983) 33-44.
12. M.S. Jacobson and L.F. Kinch, On the domination of the products of graphs II: trees, J. Graph Theory 10 (1986) 97-106.
13. S. Klavžar and N. Seifter, Dominating Cartesian products of cycles, Discrete Appl. Math. 59 (1995) 129-136.
14. N. Robertson and P.D. Seymour, Graph minors II. Algorithmic aspects of tree-width, J. Algorithms 7 (1986) 309-322.
15. W.A. Seitz, D.J. Klein and A. Graovac, Transfer matrix methods for regular polymer graphs, in: R.C. Lacher, ed., Studies in Physical and Theoretical Chemistry, Vol. 54 (Elsevier, Amsterdam, 1988) 157-171.
16. J. van Leeuwen, Graph algorithms, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. A, Algorithms and Complexity (Elsevier, Amsterdam, 1990) 525-631.
17. A. Wongseelashote, Semirings and path spaces, Discrete Math. 26 (1979) 55-78.
18. J. Žerovnik, A method for proving formulas on polygraphs, manuscript.
19. U. Zimmermann, Linear and Combinatorial Optimization in Ordered Algebraic Structures, Ann. Discrete Math. 10 (North-Holland, Amsterdam, 1981).
20. T.Y. Chang, W.E. Clark and E.O. Hare, Domination numbers of complete grid graphs, part I, Ars Combin. 38 (1994) 97-111.
21. D.C. Fisher, The domination number of complete grid graphs, submitted to J. Graph Theory.