Structure of edges in a 4-connected graph not contained in triangles and the number of contractible edges

Let be a 4-connected graph, and let denote the set of those edges of which are not contained in a triangle, and let denote the set of 4-contractible edges of . We show that if or , then unless has one of the three specified configurations.

Sparad:
Bibliografiska uppgifter
Huvudupphovsmän: Yoshimi Egawa, Keiko Kotani, Shunsuke Nakamura
Materialtyp: Artigo
Språk:Inglês
Publicerad: Taylor & Francis Group 2018-08-01
Serie:AKCE International Journal of Graphs and Combinatorics
Ämnen:
4-connected graph
contractible edge
triangle
Länkar:http://dx.doi.org/10.1016/j.akcej.2017.09.002
Taggar: Lägg till en tagg
Inga taggar, Lägg till första taggen!

Liknande verk