Author:
Ahadi A.,Besharati Nazli,Mahmoodian E. S.,Mortezaeefar M.
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference17 articles.
1. Alspach B., Hare D.: Edge-pancyclic block-intersection graphs. Discrete Math. 97(1–3), 17–24 (1991)
2. Alspach, B., Heinrich, K., Mohar, B.: A note on Hamilton cycles in block-intersection graphs. In: Finite Geometries and Combinatorial Designs (Lincoln, NE, 1987). Contemporary Mathematics, vol. 111, pp. 1–4. American Mathematical Society, Providence (1990)
3. Amini, O., Esperet, L., van den Heuvel, J.: A unified approach to distance-two colouring of planar graphs. In: SODA ’09: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 273–282. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2009)
4. Behzad, M., Mahmoodian, E.S.: Graphs versus designs—a quasisurvey. In: Graph Theory, Combinatorics, and Applications, vol. 1 (Kalamazoo, MI, 1988). Wiley-Interscience Publication, pp. 125–142. Wiley, New York (1991)
5. Colbourn, C.J., Dinitz, J.H. (eds.): Handbook of Combinatorial Designs. Discrete Mathematics and Its Applications (Boca Raton), 2nd edn. Chapman & Hall/CRC, Boca Raton (2007)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献