共 50 条
- [33] On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs [J]. FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS, 2009, 5699 : 145 - 156
- [37] The Isomorphism Problem for Planar 3-Connected Graphs Is in Unambiguous Logspace [J]. Theory of Computing Systems, 2010, 47 : 655 - 673
- [39] Longest Cycles in 3-connected Graphs with Given Independence Number [J]. Graphs and Combinatorics, 2009, 25 : 377 - 384