Mathematical Sciences Classification System
05Cxx - Graph theory
{For applications of graphs, see 68R10, 81Q30, 81T15, 82B20, 82C20, 90C35, 92E10, 94C15}
-
05C05Trees
-
05C07Vertex degrees [See also 05E30]
-
05C10
-
05C12Distance in graphs
-
05C15Coloring of graphs and hypergraphs
-
05C17Perfect graphs
-
05C20Directed graphs (digraphs), tournaments
-
05C21Flows in graphs
-
05C22Signed and weighted graphs
-
05C25Graphs and abstract algebra (groups, rings, fields, etc.) [See also 20F65]
-
05C30Enumeration in graph theory
-
05C31Graph polynomials
-
05C35Extremal problems [See also 90C35]
-
05C38Paths and cycles [See also 90B10]
-
05C40Connectivity
-
05C42Density (toughness, etc.)
-
05C45Eulerian and Hamiltonian graphs
-
05C50Graphs and linear algebra (matrices, eigenvalues, etc.)
-
05C51Graph designs and isomomorphic decomposition [See also 05B30]
-
05C55Generalized Ramsey theory [See also 05D10]
-
05C57
-
05C60Isomorphism problems (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
-
05C62Graph representations (geometric and intersection representations, etc.) {For graph drawing, see also 68R10}
-
05C63Infinite graphs
-
05C65Hypergraphs
-
05C69Dominating sets, independent sets, cliques
-
05C70Factorization, matching, partitioning, covering and packing
-
05C72Fractional graph theory, fuzzy graph theory
-
05C75Structural characterization of families of graphs
-
05C76Graph operations (line graphs, products, etc.)
-
05C78Graph labelling (graceful graphs, bandwidth, etc.)
-
05C80Random graphs [See also 60B20]
-
05C81Random walks on graphs
-
05C82
-
05C83Graph minors
-
05C85
-
05C90
-
05C99None of the above, but in this section