Search and Browse the MSC 2000

05-XX Combinatorics {For finite fields, see 11Txx} → ZMATH

05Cxx Graph theory {For applications of graphs, see 68R10, 90C35, 94C15} → ZMATH

05C05 Trees → ZMATH

05C07 Degree sequences → ZMATH

05C10 Topological graph theory, imbedding [See also 57M15, 57M25] → ZMATH

05C12 Distance in graphs → ZMATH

05C15 Coloring of graphs and hypergraphs → ZMATH

05C17 Perfect graphs → ZMATH

05C20 Directed graphs (digraphs), tournaments → ZMATH

05C22 Signed, gain and biased graphs → ZMATH

05C25 Graphs and groups [See also 20F65] → ZMATH

05C30 Enumeration of graphs and maps → ZMATH

05C35 Extremal problems [See also 90C35] → ZMATH

05C38 Paths and cycles [See also 90B10] → ZMATH

05C40 Connectivity → ZMATH

05C45 Eulerian and Hamiltonian graphs → ZMATH

05C50 Graphs and matrices → ZMATH

05C55 Generalized Ramsey theory → ZMATH

05C60 Isomorphism problems (reconstruction conjecture, etc.) → ZMATH

05C62 Graph representations (geometric and intersection representations, etc.) → ZMATH

05C65 Hypergraphs → ZMATH

05C69 Dominating sets, independent sets, cliques → ZMATH

05C70 Factorization, matching, covering and packing → ZMATH

05C75 Structural characterization of types of graphs → ZMATH

05C78 Graph labelling (graceful graphs, bandwidth, etc.) → ZMATH

05C80 Random graphs → ZMATH

05C83 Graph minors → ZMATH

05C85 Graph algorithms [See also 68R10, 68W05] → ZMATH

05C90 Applications → ZMATH

05C99 None of the above, but in this section → ZMATH