Nebeský, Ladislav(CZ-KARLQ): Signpost systems and spanning trees of graphs. (English summary). - Czechoslovak Math. J. 56(131) (2006), no. 3, 885--893
Abstract
Nebesk'y Ladislav: Signpost systems and spanning trees of graphs, Czechoslovak Math. J. 56(131) (2006), no. 3, 885-893.
Keywords
signpost system;path;connected graph;tree;spanning tree;
Data
| Language: | English |
|---|---|
| Year of publishing: | 2007 |
| Typology: | 1.19 - Review, Book Review, Critique |
| Organization: | UM FERI - Faculty of Electrical Engineering and Computer Science |
| UDC: | 519.17(049.3) |
| COBISS: |
11585046
|
| ISSN: | Y505-9674 |
| Views: | 915 |
| Downloads: | 23 |
| Average score: | 0 (0 votes) |
| Metadata: |
|
Other data
| Secondary language: | English |
|---|---|
| Secondary keywords: | matematika;teorija grafov; |
| URN: | URN:SI:UM: |
| Pages: | MR2261660 |
| Chronology: | 2007 |
| ID: | 8717171 |
Recommended works:
Nebeský, Ladislav(CZ-KARLQ): Signpost systems and spanning trees of graphs. (English summary). - Czechoslovak Math. J. 56(131) (2006), no. 3, 885--893
2007,
no subtitle data available
Karami, H.; Sheikholeslami, S. M.; Khodkar, Abdollah (1-WGA): Lower bounds on signed edge total domination numbers in graphs. (English summary). - Czechoslovak Math. J. 58(133) (2008), no. 3, 595--603
2009,
no subtitle data available
Bendall, Sarah; Hammack, Richard: Centers of $n$-fold tensor products of graphs. (English summary). - Discuss. Math. Graph Theory 24 (2004), no. 3, 491--501.
2005,
no subtitle data available