Standard

Minimal κ-connected Graphs with Small Number of Vertices of Degree κ. / Karpov, Dmitri V.

In: Fundamenta Informaticae, Vol. 145, No. 3, 01.01.2016, p. 279-312.

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

Harvard

Karpov, DV 2016, 'Minimal κ-connected Graphs with Small Number of Vertices of Degree κ', Fundamenta Informaticae, vol. 145, no. 3, pp. 279-312. https://doi.org/10.3233/FI-2016-1361

APA

Karpov, D. V. (2016). Minimal κ-connected Graphs with Small Number of Vertices of Degree κ. Fundamenta Informaticae, 145(3), 279-312. https://doi.org/10.3233/FI-2016-1361

Vancouver

Karpov DV. Minimal κ-connected Graphs with Small Number of Vertices of Degree κ. Fundamenta Informaticae. 2016 Jan 1;145(3):279-312. https://doi.org/10.3233/FI-2016-1361

Author

Karpov, Dmitri V. / Minimal κ-connected Graphs with Small Number of Vertices of Degree κ. In: Fundamenta Informaticae. 2016 ; Vol. 145, No. 3. pp. 279-312.

BibTeX

@article{d91bf44fac9a4707af94dd225cb051cc,
title = "Minimal κ-connected Graphs with Small Number of Vertices of Degree κ",
abstract = "Connectivity is one of the basic concepts of graph theory. It asks for the minimum number of elements. A graph is called k-connected or k-vertex-connected if its vertex connectivity is k or greater. The author defines a connected component of a graph as a vertex set of its maximal up to inclusion connected subgraph.",
author = "Karpov, {Dmitri V.}",
year = "2016",
month = jan,
day = "1",
doi = "10.3233/FI-2016-1361",
language = "English",
volume = "145",
pages = "279--312",
journal = "Fundamenta Informaticae",
issn = "0169-2968",
publisher = "IOS Press",
number = "3",

}

RIS

TY - JOUR

T1 - Minimal κ-connected Graphs with Small Number of Vertices of Degree κ

AU - Karpov, Dmitri V.

PY - 2016/1/1

Y1 - 2016/1/1

N2 - Connectivity is one of the basic concepts of graph theory. It asks for the minimum number of elements. A graph is called k-connected or k-vertex-connected if its vertex connectivity is k or greater. The author defines a connected component of a graph as a vertex set of its maximal up to inclusion connected subgraph.

AB - Connectivity is one of the basic concepts of graph theory. It asks for the minimum number of elements. A graph is called k-connected or k-vertex-connected if its vertex connectivity is k or greater. The author defines a connected component of a graph as a vertex set of its maximal up to inclusion connected subgraph.

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

U2 - 10.3233/FI-2016-1361

DO - 10.3233/FI-2016-1361

M3 - Article

AN - SCOPUS:84984906771

VL - 145

SP - 279

EP - 312

JO - Fundamenta Informaticae

JF - Fundamenta Informaticae

SN - 0169-2968

IS - 3

ER -

ID: 36925247