05Cxx Graph theory ( 0 Dok. )

• 05C05 Trees ( 0 Dok. )
• 05C07 Degree sequences ( 0 Dok. )
• 05C10 Topological graph theory, imbedding ( 0 Dok. )
• 05C12 Distance in graphs ( 0 Dok. )
• 05C15 Coloring of graphs and hypergraphs ( 0 Dok. )
• 05C17 Perfect graphs ( 0 Dok. )
• 05C20 Directed graphs (digraphs), tournaments ( 0 Dok. )
• 05C22 Signed, gain and biased graphs ( 0 Dok. )
• 05C25 Graphs and groups ( 0 Dok. )
• 05C30 Enumeration of graphs and maps ( 0 Dok. )
• 05C35 Extremal problems ( 0 Dok. )
• 05C38 Paths and cycles ( 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, etc.) ( 0 Dok. )
• 05C62 Graph representations (geometric and intersection representations, etc.) ( 0 Dok. )
• 05C65 Hypergraphs ( 0 Dok. )
• 05C69 Dominating sets, independent sets, cliques ( 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. )
• 05C83 Graph minors ( 0 Dok. )
• 05C85 Graph algorithms ( 0 Dok. )
• 05C90 Applications ( 0 Dok. )
• 05C99 None of the above, but in this section ( 0 Dok. )

---

Home | Bibliographische Suche | Volltextsuche| Veröffentlichen

---

Fragen und Anregungen an opus-team@zib.de

---

Letzte Änderung: 15.08.05