Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji:
http://hdl.handle.net/11320/21587| Tytuł: | The Class of Series-Parallel Graphs. Part II |
| Autorzy: | Retel, Krzysztof |
| Data wydania: | 2003 |
| Data dodania: | 20-lis-2026 |
| Wydawca: | University of Białystok |
| Źródło: | Formalized Mathematics, Volume 11, Issue 3, Pages 289-291 |
| Abstrakt: | In this paper we introduce two new operations on graphs: sum and union corresponding to parallel and series operation respectively. We determine N-free graph as the graph that does not embed Necklace 4. We define “fin RelStr” as the set of all graphs with finite carriers.We also define the smallest class of graphs which contains the one-element graph and which is closed under parallel and series operations. The goal of the article is to prove the theorem that the class of finite series-parallel graphs is the class of finite N-free graphs. This paper formalizes the next part of [12]. |
| Afiliacja: | University of Białystok |
| Sponsorzy: | This work has been partially supported by CALCULEMUS grant HPRN-CT-2000-00102. |
| URI: | http://hdl.handle.net/11320/21587 |
| ISSN: | 1426-2630 |
| e-ISSN: | 1898-9934 |
| Typ Dokumentu: | Article |
| metadata.dc.rights.uri: | https://creativecommons.org/licenses/by-sa/4.0/ |
| Właściciel praw: | © 2003 University of Białystok This work is licensed under the Creative Commons License. |
| Występuje w kolekcji(ach): | Formalized Mathematics, 2003, Volume 11, Issue 3 |
Pliki w tej pozycji:
| Plik | Opis | Rozmiar | Format | |
|---|---|---|---|---|
| The_Class_of_Series-Parallel_Graphs_Part_II.pdf | 53,9 kB | Adobe PDF | Otwórz |
Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL
