Diskretnaya Matematika
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


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnaya Matematika, 2003, Volume 15, Issue 3, Pages 105–116
DOI: https://doi.org/10.4213/dm209 (Mi dm209) 		 
This article is cited in 3 scientific papers (total in 3 papers)

The structure and methods of generation of closed classes of graphs

M. A. Iordanskii
Full-text PDF (1301 kB) Citations (3)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm209
Abstract: We consider a functional approach to a system of graphs with operations: we study the structure of classes of graphs closed with respect to some operations, the total number of closed classes, the number of precomplete classes and methods of generating the classes.
We indicate the systems of operations with respect to which the sets of closed classes of graphs are continual, countable or finite. It is shown that systems of operations realise all possibilities of generation of closed classes of graphs: there exist classes with finite, countable bases, and classes which have no bases.
The research was supported by the Russian Foundation for Basic research, grant 01–01–00464.
Received: 28.10.2002
English version:
Discrete Mathematics and Applications, 2003, Volume 13, Issue 4, Pages 405–416
DOI: https://doi.org/10.1515/156939203322556063
Bibliographic databases:
UDC: 519.7
Language: Russian
Citation: M. A. Iordanskii, “The structure and methods of generation of closed classes of graphs”, Diskr. Mat., 15:3 (2003), 105–116; Discrete Math. Appl., 13:4 (2003), 405–416
Citation in format AMSBIB
\Bibitem{Ior03}
\by M.~A.~Iordanskii
\paper The structure and methods of generation of closed classes of graphs
\jour Diskr. Mat.
\yr 2003
\vol 15
\issue 3
\pages 105--116
\mathnet{http://mi.mathnet.ru/dm209}
\crossref{https://doi.org/10.4213/dm209}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2021208}
\zmath{https://zbmath.org/?q=an:1048.05071}
\transl
\jour Discrete Math. Appl.
\yr 2003
\vol 13
\issue 4
\pages 405--416
\crossref{https://doi.org/10.1515/156939203322556063}
Linking options:
  • https://www.mathnet.ru/eng/dm209
  • https://doi.org/10.4213/dm209
  • https://www.mathnet.ru/eng/dm/v15/i3/p105
    • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:590
    Full-text PDF :369
    References:57
    First page:4
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024