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

DOI10.1016/j.endm.2018.06.005zbMath1397.05092MaRDI QIDQ1792054

Yoshimi Egawa, Keiko Kotani, Shunsuke Nakamura

Publication date: 11 October 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2018.06.005

zbMATH Keywords

degree; 4-connected graph; contractible edge

Mathematics Subject Classification ID

05C40: Connectivity

05C07: Vertex degrees

Related Items

Lower bound on the number of contractible edges in a 4-connected graph with edges not contained in triangles

Cites Work

• Edges not contained in triangles and the number of contractible edges in a 4-connected graph
• A recursive characterization of the 4-connected graphs
• Contractible edges in a 4-connected graph with vertices of degree greater than four
• On the number of 4-contractible edges in 4-connected graphs
• THE NUMBER OF CONTRACTIBLE EDGES IN A 4-CONNECTED GRAPH HAVING A SMALL NUMBER OF EDGES NOT CONTAINED IN TRIANGLES
• THE EXISTENCE CONDITION OF A 4-CONNECTED GRAPH WITH SPECIFIED CONFIGURATIONS
• Unnamed Item
• Unnamed Item
• Unnamed Item