Loading...

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.

Na minha lista:
Bibliografiske detaljer
Main Authors: Yoshimi Egawa, Keiko Kotani, Shunsuke Nakamura
Format: Artigo
Sprog:Inglês
Udgivet: Taylor & Francis Group 2018-08-01
Serier:AKCE International Journal of Graphs and Combinatorics
Fag:
Online adgang:http://dx.doi.org/10.1016/j.akcej.2017.09.002
Tags: Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!