Standard

Deleting Vertices from a 2-Connected Graph with Preserving 2-Connectedness. / Karpov, D. V.

в: Journal of Mathematical Sciences (United States), Том 212, № 6, 01.02.2016, стр. 683-687.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Karpov, DV 2016, 'Deleting Vertices from a 2-Connected Graph with Preserving 2-Connectedness', Journal of Mathematical Sciences (United States), Том. 212, № 6, стр. 683-687. https://doi.org/10.1007/s10958-016-2698-0

APA

Karpov, D. V. (2016). Deleting Vertices from a 2-Connected Graph with Preserving 2-Connectedness. Journal of Mathematical Sciences (United States), 212(6), 683-687. https://doi.org/10.1007/s10958-016-2698-0

Vancouver

Karpov DV. Deleting Vertices from a 2-Connected Graph with Preserving 2-Connectedness. Journal of Mathematical Sciences (United States). 2016 Февр. 1;212(6):683-687. https://doi.org/10.1007/s10958-016-2698-0

Author

Karpov, D. V. / Deleting Vertices from a 2-Connected Graph with Preserving 2-Connectedness. в: Journal of Mathematical Sciences (United States). 2016 ; Том 212, № 6. стр. 683-687.

BibTeX

@article{9dc8bd954b9a43629bd68cd4c9ffb1da,
title = "Deleting Vertices from a 2-Connected Graph with Preserving 2-Connectedness",
abstract = "Let G be a 2-connected graph, and let W be a set of internal vertices of block parts of G that contains at least one vertex in each of these parts. It is proved that the graph G−W is 2-connected.",
keywords = "Bipartite Graph, Chromatic number, Decomposition Tree, Internal Vertex, Block Part",
author = "Karpov, {D. V.}",
note = "Karpov, D.V. Deleting Vertices from a 2-Connected Graph with Preserving 2-Connectedness. J Math Sci 212, 683–687 (2016). https://doi.org/10.1007/s10958-016-2698-0",
year = "2016",
month = feb,
day = "1",
doi = "10.1007/s10958-016-2698-0",
language = "English",
volume = "212",
pages = "683--687",
journal = "Journal of Mathematical Sciences",
issn = "1072-3374",
publisher = "Springer Nature",
number = "6",

}

RIS

TY - JOUR

T1 - Deleting Vertices from a 2-Connected Graph with Preserving 2-Connectedness

AU - Karpov, D. V.

N1 - Karpov, D.V. Deleting Vertices from a 2-Connected Graph with Preserving 2-Connectedness. J Math Sci 212, 683–687 (2016). https://doi.org/10.1007/s10958-016-2698-0

PY - 2016/2/1

Y1 - 2016/2/1

N2 - Let G be a 2-connected graph, and let W be a set of internal vertices of block parts of G that contains at least one vertex in each of these parts. It is proved that the graph G−W is 2-connected.

AB - Let G be a 2-connected graph, and let W be a set of internal vertices of block parts of G that contains at least one vertex in each of these parts. It is proved that the graph G−W is 2-connected.

KW - Bipartite Graph

KW - Chromatic number

KW - Decomposition Tree

KW - Internal Vertex

KW - Block Part

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

U2 - 10.1007/s10958-016-2698-0

DO - 10.1007/s10958-016-2698-0

M3 - Article

AN - SCOPUS:84953341743

VL - 212

SP - 683

EP - 687

JO - Journal of Mathematical Sciences

JF - Journal of Mathematical Sciences

SN - 1072-3374

IS - 6

ER -

ID: 36925121