A Characterization of weakly four-connected graphs

Research output: Contribution to journalArticle

2 Citations (Scopus)


A graph G = (V, E) is called weakly four-connected if G is 4-edge-connected and G - x is 2-edge-connected for all x ∈ V. We give sufficient conditions for the existence of 'splittable' vertices of degree four in weakly four-connected graphs. By using these results we prove that every minimally weakly four-connected graph on at least four vertices contains at least three 'splittable' vertices of degree four, which gives rise to an inductive construction of weakly four-connected graphs. Our results can also be applied in the problem of finding 2-connected orientations of graphs.

Original languageEnglish
Pages (from-to)217-229
Number of pages13
JournalJournal of Graph Theory
Issue number3
Publication statusPublished - Jul 1 2006



  • Connectivity of graphs
  • Edge splitting
  • Weakly four-connected

ASJC Scopus subject areas

  • Geometry and Topology

Cite this