The paper studies the structure of k-vertex cutsets in a k-connected graph. As an illustration of the method proposed, the well-known case of a biconnected graph is considered. Bibliography: 8 titles.

Original languageEnglish
Pages (from-to)4953-4966
Number of pages14
JournalJournal of Mathematical Sciences
Volume145
Issue number3
DOIs
StatePublished - 1 Sep 2007

    Scopus subject areas

  • Mathematics(all)

ID: 36926006