Zapiski Nauchnykh Seminarov POMI
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Zap. Nauchn. Sem. POMI:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Zapiski Nauchnykh Seminarov POMI, 2013, Volume 417, Pages 11–85 (Mi znsl5709)  
Generalized flowers in $k$-connected graph. Part 2

A. L. Glazmanab

a St. Petersburg Department of the Steklov Mathematical Institute, St. Petersburg, Russia
b Section de Mathématiques, Université de Genève. 2-4 rue du Lièvre, Case postale 64, 1211 Genève, Suisse
Full-text PDF (921 kB)
References:
PDF
HTML
Abstract: We continue the work started in [8] and research $k$-cutsets in $k$-connected graphs. Several new statesments concerning the structure of generalized flowers in $k$-connected graphs are proved here. Generalized flowers in the case $k=4$ are considered after. For $k=4$ we give the description of maximal generalized flowers with an empty center which have a common catset.
Key words and phrases: $k$-connected graph, $4$-connected graph, cutset.
Received: 05.11.2013
English version:
Journal of Mathematical Sciences (New York), 2015, Volume 204, Issue 2, Pages 185–231
DOI: https://doi.org/10.1007/s10958-014-2197-0
Bibliographic databases:
Document Type: Article
UDC: 519.173.1
Language: Russian
Citation: A. L. Glazman, “Generalized flowers in $k$-connected graph. Part 2”, Combinatorics and graph theory. Part VI, Zap. Nauchn. Sem. POMI, 417, POMI, St. Petersburg, 2013, 11–85; J. Math. Sci. (N. Y.), 204:2 (2015), 185–231
Citation in format AMSBIB
\Bibitem{Gla13}
\by A.~L.~Glazman
\paper Generalized flowers in $k$-connected graph. Part~2
\inbook Combinatorics and graph theory. Part~VI
\serial Zap. Nauchn. Sem. POMI
\yr 2013
\vol 417
\pages 11--85
\publ POMI
\publaddr St.~Petersburg
\mathnet{http://mi.mathnet.ru/znsl5709}
\transl
\jour J. Math. Sci. (N. Y.)
\yr 2015
\vol 204
\issue 2
\pages 185--231
\crossref{https://doi.org/10.1007/s10958-014-2197-0}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84925536868}
Linking options:
  • https://www.mathnet.ru/eng/znsl5709
  • https://www.mathnet.ru/eng/znsl/v417/p11
    Cycle of papers
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Записки научных семинаров ПОМИ
    Statistics & downloads:
    Abstract page:157
    Full-text PDF :49
    References:52
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024