Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')
EuDML - The European Digital Mathematics Library

Login | Register | (Why Register?)

  • Home
  • Advanced Search
  • Browse by Subject
  • Browse by Journals
  • Refs Lookup
  • Subjects
  • 05-XX Combinatorics
  • 05Cxx Graph theory
  • 05C99 None of the above, but in this section

05Cxx Graph theory

  • 05C05 Trees
  • 05C07 Vertex degrees
  • 05C10 Planar graphs; geometric and topological aspects of graph theory
  • 05C12 Distance in graphs
  • 05C15 Coloring of graphs and hypergraphs
  • 05C17 Perfect graphs
  • 05C20 Directed graphs (digraphs), tournaments
  • 05C21 Flows in graphs
  • 05C22 Signed and weighted graphs
  • 05C25 Graphs and abstract algebra (groups, rings, fields, etc.)
  • 05C30 Enumeration in graph theory
  • 05C31 Graph polynomials
  • 05C35 Extremal problems
  • 05C38 Paths and cycles
  • 05C40 Connectivity
  • 05C42 Density (toughness, etc.)
  • 05C45 Eulerian and Hamiltonian graphs
  • 05C50 Graphs and linear algebra (matrices, eigenvalues, etc.)
  • 05C51 Graph designs and isomomorphic decomposition
  • 05C55 Generalized Ramsey theory
  • 05C57 Games on graphs
  • 05C60 Isomorphism problems (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
  • 05C62 Graph representations (geometric and intersection representations, etc.) {For graph drawing, see also }
  • 05C63 Infinite graphs
  • 05C65 Hypergraphs
  • 05C69 Dominating sets, independent sets, cliques
  • 05C70 Factorization, matching, partitioning, covering and packing
  • 05C72 Fractional graph theory, fuzzy graph theory
  • 05C75 Structural characterization of families of graphs
  • 05C76 Graph operations (line graphs, products, etc.)
  • 05C78 Graph labelling (graceful graphs, bandwidth, etc.)
  • 05C80 Random graphs
  • 05C81 Random walks on graphs
  • 05C82 Small world graphs, complex networks
  • 05C83 Graph minors
  • 05C85 Graph algorithms
  • 05C90 Applications
  • 05C99 None of the above, but in this section
  • Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 30

Displaying 581 – 585 of 585

Showing per page

Рекуррентное соотношение, связанное со стягиваниями графа.

В.В. Матюшков (1970)

Sibirskij matematiceskij zurnal

Свободные произведения сеток и свободные симметризаторы графов

Д.В. Знойко (1975)

Matematiceskij sbornik

Структуры, порожденные инвариантами

В.П. Федотов (1979)

Zapiski naucnych seminarov Leningradskogo

Хроматические и размерностные многочлены триангулированных графов

В.И. Волошин (1982)

Matematiceskie issledovanija

Частично упорядоченные множества и их графы сравнимости

Л.Н. Шеврин, Н.Д. Филиппов (1970)

Sibirskij matematiceskij zurnal

Currently displaying 581 – 585 of 585

Previous Page 30

EuDML
  • About EuDML initiative
  • Feedback
  •  version 2.1.7