Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference15 articles.
1. K. Ando, and, K. Kawarabayashi, Some forbidden subgraph conditions for a graph to have a k-contractible edge, Discrete Math, to appear.
2. K. Ando, A. Kaneko, and, K. Kawarabayashi, Contractible edges in minimally k-connected graphs, preprint.
3. Cycles in k-connected graphs whose deletion results in a (k−2)-connected graph;Egawa;J. Combin. Theory,1987
4. Contractible edges in n-connected graphs with minimum degree greater than or equal to [5n4];Egawa;Graphs Combin.,1991
5. Contractible edges in triangle-free graphs;Egawa;Combinatorica,1986
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献