THE NUMBER OF CONTRACTIBLE EDGES IN A 4-CONNECTED GRAPH HAVING A SMALL NUMBER OF EDGES NOT CONTAINED IN TRIANGLES

DOI10.17654/AADMAPR2015_153_166zbMath1325.05099OpenAlexW2519134225MaRDI QIDQ3452756

Shunsuke Nakamura, Keiko Kotani

Publication date: 13 November 2015

Published in: Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.pphmj.com/abstract/9137.htm

zbMATH Keywords

triangle4-connected graphcontractible edge

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (3)

Structure of edges in a 4-connected graph not contained in triangles and the number of contractible edges ⋮ Lower bound on the number of contractible edges in a 4-connected graph with edges not contained in triangles ⋮ Edges incident with a vertex of degree greater than four and a lower bound on the number of contractible edges in a 4-connected graph

This page was built for publication: THE NUMBER OF CONTRACTIBLE EDGES IN A 4-CONNECTED GRAPH HAVING A SMALL NUMBER OF EDGES NOT CONTAINED IN TRIANGLES