Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference6 articles.
1. On primitive sets in graphs;Hager;Europ. J. Combinatorics,1982
2. Über trennende Eckenmengen in Graphen und den Mengerschen Satz;Halin;Math. Annalen,1964
3. On well-quasi ordering finite trees;Nash-Williams,1963
4. On well-quasi ordering infinite trees;Nash-Williams,1965
5. Treillis de séparation des graphs;Polat;Canad. J. Math.,1976
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Representing a concept lattice by a graph;Discrete Applied Mathematics;2004-11
2. Maintaining Class Membership Information;Advances in Object-Oriented Information Systems;2002
3. Lattices Related to Separation in Graphs;Finite and Infinite Combinatorics in Sets and Logic;1993