When m vertices in a k-connected graph cannot be walked round along a simple cycle

A. K. Kelmans; M. V. Lomonosov

doi:10.1016/0012-365X(82)90299-0

When m vertices in a k-connected graph cannot be walked round along a simple cycle

A. K. Kelmans, M. V. Lomonosov

Research output: Contribution to journal › Article › peer-review

16 Scopus citations

Original language	English
Pages (from-to)	317-322
Number of pages	6
Journal	Discrete Mathematics
Volume	38
Issue number	2-3
DOIs	https://doi.org/10.1016/0012-365X(82)90299-0
State	Published - 1 Jan 1982
Externally published	Yes

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/0012-365X(82)90299-0

Cite this

@article{c9ee0dbdd2624a97bedc1da59a164644,

title = "When m vertices in a k-connected graph cannot be walked round along a simple cycle",

author = "Kelmans, {A. K.} and Lomonosov, {M. V.}",

year = "1982",

month = jan,

day = "1",

doi = "10.1016/0012-365X(82)90299-0",

language = "English",

volume = "38",

pages = "317--322",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "2-3",

}

TY - JOUR

T1 - When m vertices in a k-connected graph cannot be walked round along a simple cycle

AU - Kelmans, A. K.

AU - Lomonosov, M. V.

PY - 1982/1/1

Y1 - 1982/1/1

UR - http://www.scopus.com/inward/record.url?scp=34547499007&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(82)90299-0

DO - 10.1016/0012-365X(82)90299-0

M3 - Article

AN - SCOPUS:34547499007

SN - 0012-365X

VL - 38

SP - 317

EP - 322

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 2-3

ER -

When m vertices in a k-connected graph cannot be walked round along a simple cycle

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this