Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnyi Analiz i Issledovanie Operatsii, 2008, Volume 15, Issue 6, Pages 3–10 (Mi da552)  
This article is cited in 9 scientific papers (total in 9 papers)

A criterion for a class of graphs to be a boundary class and applications

V. E. Alekseev, D. S. Malyshev

N. I. Lobachevski State University of Nizhni Novgorod
Full-text PDF (241 kB) Citations (9)
References:
PDF
HTML
Abstract: A new definition of the boundary class of graphs is given and the corresponding criterion is proved. The class of all graphs in which every connected component is a tree with at most three leaves is considered as an example. This class is known to be the boundary class for several graph problems. We establish some sufficient conditions for this class to be a boundary class and prove that it is the boundary class for the bipartite subgraph and the planar subgraph problems. Bibl. 8.
Keywords: computational complexity, boundary class, maximum subgraph problem.
Received: 16.06.2008
Revised: 01.10.2008
Bibliographic databases:
UDC: 519.178
Language: Russian
Citation: V. E. Alekseev, D. S. Malyshev, “A criterion for a class of graphs to be a boundary class and applications”, Diskretn. Anal. Issled. Oper., 15:6 (2008), 3–10
Citation in format AMSBIB
\Bibitem{AleMal08}
\by V.~E.~Alekseev, D.~S.~Malyshev
\paper A criterion for a class of graphs to be a~boundary class and applications
\jour Diskretn. Anal. Issled. Oper.
\yr 2008
\vol 15
\issue 6
\pages 3--10
\mathnet{http://mi.mathnet.ru/da552}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2543142}
\zmath{https://zbmath.org/?q=an:1249.05363}
Linking options:
  • https://www.mathnet.ru/eng/da552
  • https://www.mathnet.ru/eng/da/v15/i6/p3
    • This publication is cited in the following 9 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:523
    Full-text PDF :98
    References:49
    First page:12
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024