Mathematics Subject Classification 1991

05Cxx Graph theory, {For applications of graphs, See 68Q90, 68R10, 90C35, 94C15} ( 0 Dok. )

• 05C05 Trees ( 0 Dok. )
• 05C10 Topological graph theory, imbedding, See also {57M15, 57M25} ( 0 Dok. )
• 05C12 Distance in graphs ( 0 Dok. )
• 05C15 Chromatic theory of graphs and maps ( 0 Dok. )
• 05C20 Directed graphs (digraphs), tournaments ( 0 Dok. )
• 05C25 Graphs and groups, See also {20F32} ( 0 Dok. )
• 05C30 Enumeration of graphs and maps ( 0 Dok. )
• 05C35 Extremal problems, See also {90C35} ( 0 Dok. )
• 05C38 Paths and cycles, See also {90B10} ( 0 Dok. )
• 05C40 Connectivity ( 0 Dok. )
• 05C45 Eulerian and Hamiltonian graphs ( 0 Dok. )
• 05C50 Graphs and matrices ( 0 Dok. )
• 05C55 Generalized Ramsey theory ( 0 Dok. )
• 05C60 Isomorphism problems (reconstruction conjecture, perfect graphs, etc.) ( 0 Dok. )
• 05C65 Hypergraphs ( 0 Dok. )
• 05C70 Factorization, matching, covering and packing ( 0 Dok. )
• 05C75 Structural characterization of types of graphs ( 0 Dok. )
• 05C78 Graph labelling (graceful graphs, bandwidth, etc.) ( 0 Dok. )
• 05C80 Random graphs ( 0 Dok. )
• 05C85 Graph algorithms, See also {68Q20, 68R10} ( 0 Dok. )
• 05C90 Applications ( 0 Dok. )
• 05C99 None of the above but in this section ( 0 Dok. )