Edges incident with a vertex of degree greater than four and the number of contractible edges in a 4-connected graph

DOI10.1016/J.DAM.2024.04.031MaRDI QIDQ6559399zbMATH OpenFDO

Authors Yoshimi Egawa, Shunsuke Nakamura

Publication date 21 June 2024

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2024.04.031

zbMATH Keywords

4-connected graphcontractible edgecross free graph

Mathematics Subject Classification ID

Vertex degrees (05C07) Connectivity (05C40)

Recommendations

• 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
• Contractible edges in a 4-connected graph with vertices of degree greater than four
• Edges not contained in triangles and the number of contractible edges in a 4-connected graph
• Distribution of contractible edges and the structure of noncontractible edges having endvertices with large degree in a 4-connected graph
• The number of contractible edges in a 4-connected graph having a contractible edge not contained in triangles

Cites work

• A survey on contractible edges in graphs of a prescribed vertex connectivity
• Average degree and contractibility
• Contractible edges in 3-connected graphs
• Contractible edges in a 4-connected graph with vertices of degree greater than four
• Distribution of contractible edges and the structure of noncontractible edges having endvertices with large degree in a 4-connected graph
• Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph
• Edges not contained in triangles and the number of contractible edges in a 4-connected graph
• Graph theory
• scientific article; zbMATH DE number 3166039 (Why is no real title available?)
• scientific article; zbMATH DE number 3600073 (Why is no real title available?)
• Lower bound on the number of contractible edges in a 4-connected graph with edges not contained in triangles
• On the number of 4-contractible edges in 4-connected graphs
• THE EXISTENCE CONDITION OF A 4-CONNECTED GRAPH WITH SPECIFIED CONFIGURATIONS
• The number of contractible edges in a 4-connected graph having a contractible edge not contained in triangles
• The number of vertices of degree 5 in a contraction-critically 5-connected graph
• Uncontractable 4-connected graphs

This page was built for publication: Edges incident with a vertex of degree greater than four and the number of contractible edges in a 4-connected graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6559399)