图论方向

Minors of Quasi 4-Connected Grphs / T . Politof and A . Satyanarayana.—Discrete math . Inspress.

Homorphies?tze für Graphen / W . Mader. –Math . Ann . 178 (1968) 154—168.

Graph theory / f. Harary . – Addison –Wesley , Reading , MA (1969).

über minimalstruktruren Von Graphen , Insbensondere Von N- Fach Zusammenh-üngenden Graphen / R . halin and h . A .Jung . – Math . Ann . 152 (1963)75—94.

On the Structure of 5-and 6-chromatic Graphs / G . A. Dirac .—J. Reine Angev . Math . 214/ 215 (1964) 127—132.

Homeomorphism Theorems for Graphs / G . A . Dirac .--Math . Ann . 153 (1964)69—80.

Generalizations of the Five Colour Theorem / G . A. Dirac . – theory of Graphs and Its Applications . Academic Press , New York (1964) 21—27.

Extremál Graph Theory / B . Bollobas .—Academic Press , New York . (1978).

In Abstrakten Graphen Vollst?ndige 4-Graphen und ihre Untereilungen / G . A . Dirac . – Math .Nach . 22 (1960) 61—85.

Steiner Trees , Partial 2-Trees, and Minimum IFI Neworks / J . A . Waldf and C .J . Colbourn. – Network 13 (1983) 159—167.

Connectivity in Graphs / W . T . Tutte. – Toronto University Press , Toronto (1966).

On simple Characterization of K- trees / D . J . Rose . –Discre . Math . 7 (1974) 317—322.

Triangulated Graphs and the Eliminati on Process / D . J . Rose .—j . math . Anal . Appl. 32 (1970) 597—609.

A Characterization of the Partial 3-tree in Terms of Certain Strucres / Y . Kajitani , A . Ishizuka , and S . Ueno .—In Proceeedings of ISCAS 1985 , IEEE.
Topology of Series-parallel Networks / R .J . Duffin . – J . math Appl . 10 () 1965
302-318.

On rigid Circuit graphs / G . A . dirac .—Abh . math . Sem .Univ Hamburg 25 (1961)71-76, Mr 24 / 57.

Complexity of Finding Embedding in a K- Tree / S . Arnborg , D . G .Corneil and A. Proskurowski .—SIAM J . Alg . Discr . Math .8 (2) (1987) 277—284 .

Characterization and Recognition of Partial 3-Tree / S . Arnborg and A . Proskurowski.—SIAM J .Alg . Discr . Math . 7(2) (1986) 305—314.

On minois of Graphs With at Least 3n-4 edges / M. Khalilat ,T . Politok and A . Satganarayana . J . Graph ,17 (1993), 523—529.

A degree Condition for the Existence of Connected (K, K + 1)—factors / M .Cai.—systems Science and Math . Sciences , 8:4 (1995) 363—368 .

Graph Minors Ⅲ. Planar tree—loidth / N . rokerton and P .D . Seymour . – J . Comlin . Theory ser . B , 36 (1984) , 49 –64 .

Easy Piollems for Tree-Decom-posalle Graphs / S . Arnloid and J . Langergien .—J.Algoithms , 12 (1991), 308—340 .

( G , F) –Facaphs / g . liu .—Science in China , Ser . A . 38 : 7 (1995) 805—811.

A Characterization of partial 3-trees /A. Satyanarayana and L . Tung . – Networks 20 (1990) 299—322.

The Four-Color Prblem / O .Ore .—Academic Press , New York , 1967.

Introduction to Combinatorial Mathematics / C . L . Liu .—Mcgraw-Hill , 1968 .

Graph Theory / F . Harary . – Addison –Wesley , Reading , MA , 1972.

Uber Minimalstrukturen von Graphen , Insbensondere von N-Fach Zusammenhangenden Graphen / R . halin and H .A . Jung.—Math . Ann . 152 (1963)75—94.

Uber Einen Satz von K. Wagner Zum Vierfar-benproblem / R . Halin .—Math, Ann, 153 (1964) 47—62.

Extremal graph Theory / B . Bollobas . –Academic Press , New York , 1978.

Minors of Quasi 4—Connected Graphs / T . Politof, A . Satyanayana .—Discrete Mathematics , 126 (1994) 245—256.

Forbidden Minof Minof Characterization of partial 3-Trees / S . Arnborete Math . 80 (1990) 1—19.

A Characterization of Partial 3-Trees / A . Satyanarayana and L . Tung , -- Networs , 20 (1990) , 299—322.