Prikladnaya Diskretnaya Matematika. Supplement
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


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




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

Prikladnaya Diskretnaya Matematika. Supplement, 2013, Issue 6, Pages 87–89 (Mi pdma111)  
Applied graph theory

On the ordered set of connected parts of a polygonal graph

V. N. Salii

Saratov State University named after N. G. Chernyshevsky
Full-text PDF (534 kB)
References:
PDF
HTML
Abstract: Polygonal graphs, whose the ordered set of abstract connected parts is a lattice, are characterized.
Keywords: polygonal graph, linear graph, binary vector, duality, ordered set, lattice.
Document Type: Article
UDC: 519.17
Language: Russian
Citation: V. N. Salii, “On the ordered set of connected parts of a polygonal graph”, Prikl. Diskr. Mat. Suppl., 2013, no. 6, 87–89
Citation in format AMSBIB
\Bibitem{Sal13}
\by V.~N.~Salii
\paper On the ordered set of connected parts of a polygonal graph
\jour Prikl. Diskr. Mat. Suppl.
\yr 2013
\issue 6
\pages 87--89
\mathnet{http://mi.mathnet.ru/pdma111}
Linking options:
  • https://www.mathnet.ru/eng/pdma111
  • https://www.mathnet.ru/eng/pdma/y2013/i6/p87
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Prikladnaya Diskretnaya Matematika. Supplement
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024