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.

Uloženo v:
Podrobná bibliografie
Hlavní autoři: Yoshimi Egawa, Keiko Kotani, Shunsuke Nakamura
Médium: Artigo
Jazyk:Inglês
Vydáno: Taylor & Francis Group 2018-08-01
Edice:AKCE International Journal of Graphs and Combinatorics
Témata:
4-connected graph
contractible edge
triangle
On-line přístup:http://dx.doi.org/10.1016/j.akcej.2017.09.002
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!

Podobné jednotky