Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

ON PERFECT PAIR STRUCTURES IN THE SET OF SPANNING TREES OF A GRAPH

Branislav Nikolajević, Dragan M. Acketa and Ladislav A. Novak
Publikacije Elektrotehničkog fakulteta. Serija Matematika
No. 4 (1993), pp. 11-22
Stable URL: http://www.jstor.org/stable/43666352
Page Count: 12
  • Read Online (Free)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
ON PERFECT PAIR STRUCTURES IN THE SET OF SPANNING TREES OF A GRAPH
Preview not available

Abstract

Structures in the set of all spanning trees of a graph, related to the concepts of perfect pairs, hybrid bases and superperfect pairs are considered. Variety of patterns and high regularity of these structures are underlined. An algorithm for generating basic data set for these structures is presented.

Page Thumbnails

  • Thumbnail: Page 
11
    11
  • Thumbnail: Page 
12
    12
  • Thumbnail: Page 
13
    13
  • Thumbnail: Page 
14
    14
  • Thumbnail: Page 
15
    15
  • Thumbnail: Page 
16
    16
  • Thumbnail: Page 
17
    17
  • Thumbnail: Page 
18
    18
  • Thumbnail: Page 
19
    19
  • Thumbnail: Page 
20
    20
  • Thumbnail: Page 
21
    21
  • Thumbnail: Page 
22
    22