Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference20 articles.
1. Ando, K.: Contractible edges in a k-connected graph. In: Proceedings of the 7th China–Japan conference on Discrete geometry, combinatorics and graph theory, 10–20 (2007)
2. Ando, K., Kaneko, A., Kawarabayashi, K.: Contractible edges in k-connected graphs containing no $$K_4^-$$ K 4 - . SUT J. Math. 36, 99–103 (2000)
3. Ando, K., Kaneko, A., Kawarabayashi, K., Yoshimoto, K.: Contractible edges and bowties in a k-connected graph. Ars Comb. 64, 239–247 (2002)
4. Bruhn, H., Stein, M.: On end degrees and infinite circuits in locally finite graphs. Combinatorica 27, 269–291 (2007)
5. Bruhn, H., Stein, M.: Duality of ends. Combin. Probab. Comput. 12, 47–60 (2010)