Publisher
Springer Berlin Heidelberg
Reference4 articles.
1. G. Chartrand and F. Harary, Planar permutation graphs, Ann. Inst. H. Princare, Sec. B, 3 (1967), 433–438.
2. F. Harary, Graph Theory, Addison-Wesley, Mass. 1969.
3. D.J. Kleitman and D.L. Wang, Algorithms for constructing graphs and digraphs with given valences and factors, Disc. Math., 6 (1973), 79–88.
4. S.B. Rao, Characterization of forcibly planar degree sequences, I.S.I. Tech. Report No. 36/78.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献