Vertices of degree 5 in a contraction critically 5-connected graph

DOI10.1007/s00373-004-0591-yzbMath1060.05059OpenAlexW2036379534MaRDI QIDQ1777238

Atsushi Kaneko, Ken-ichi Kawarabayashi, Kiyoshi Ando

Publication date: 12 May 2005

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-004-0591-y

zbMATH Keywords

Contractible edge5-Connected graph

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (16)

On the structure of contractible edges in \(k\)-connected partial \(k\)-trees ⋮ On vertices of degree \(k\) of minimal and contraction critical \(k\)-connected graphs: upper bounds ⋮ Vertices of degree 6 in a contraction critically 6-connected graph ⋮ The new lower bound of the number of vertices of degree 5 in contraction critical 5-connected graphs ⋮ Contractible edges in \(k\)-connected graphs with some forbidden subgraphs ⋮ The removable edges and the contractible subgraphs of 5-connected graphs ⋮ Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph ⋮ Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph ⋮ The Average Degree of Minimally Contraction‐Critically 5‐Connected Graphs ⋮ Trivially noncontractible edges in a contraction critically 5-connected graph ⋮ The number of vertices of degree 5 in a contraction-critically 5-connected graph ⋮ A local structure theorem on 5-connected graphs ⋮ Some properties of contraction-critical 5-connected graphs ⋮ A constructive characterization of contraction critical 8-connected graphs with minimum degree 9 ⋮ A new lower bound on the number of trivially noncontractible edges in contraction critical 5-connected graphs ⋮ Vertices of degree 6 in a 6-contraction critical graph

This page was built for publication: Vertices of degree 5 in a contraction critically 5-connected graph