Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find




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

Avtomatika i Telemekhanika, 1976, Issue 5, Pages 151–157 (Mi at7841)  
Automata

On one problem in the graph theory

S. V. Petrov

Moscow
Full-text PDF (1300 kB)
Abstract: The problem of the graph chromatic number is studied in its relation with minimization of the number of computer memory cells and automatic classification. A grammar is developed that generates all flat triangulations with a chromatic number not exceeding four.

Received: 20.02.1975
Bibliographic databases:
Document Type: Article
UDC: 681.327.2:519.283
Language: Russian
Citation: S. V. Petrov, “On one problem in the graph theory”, Avtomat. i Telemekh., 1976, no. 5, 151–157; Autom. Remote Control, 37:5 (1976), 777–783
Citation in format AMSBIB
\Bibitem{Pet76}
\by S.~V.~Petrov
\paper On one problem in the graph theory
\jour Avtomat. i Telemekh.
\yr 1976
\issue 5
\pages 151--157
\mathnet{http://mi.mathnet.ru/at7841}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=429625}
\zmath{https://zbmath.org/?q=an:0358.05030}
\transl
\jour Autom. Remote Control
\yr 1976
\vol 37
\issue 5
\pages 777--783
Linking options:
  • https://www.mathnet.ru/eng/at7841
  • https://www.mathnet.ru/eng/at/y1976/i5/p151
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:117
    Full-text PDF :43
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024