Contents

Ars Combinatoria

  • Research article

New Sufficient Conditions for Equality of Minimum Degree and Edge-Connectivity

PETER DANKELMANN1, LUTZ VOLKMANN1
1Leurstuut II rUR MaTHEMATIK, RWTH AACHEN, TEMPLERGRABEN 55, 5100 AACHEN, GERMANY
  • Published: 31/08/1995

Abstract

New sufficient conditions for equality of edge-connectivity and minimum degree of graphs are presented, including those of Chartrand, Lesniak, Plesnik, Plesník, and Ždmán, and Volkmann.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
PETER DANKELMANN, LUTZ VOLKMANN. New Sufficient Conditions for Equality of Minimum Degree and Edge-Connectivity[J], Ars Combinatoria, Volume 040. 270-278. DOI: .