Faster access than browser!
10 relations: Annals of Mathematics, Canadian Journal of Mathematics, Connectivity (graph theory), Cycle (graph theory), Cycle basis, Cycle double cover, End (graph theory), Eulerian matroid, Eulerian path, Glossary of graph theory terms.
Annals of Mathematics
The Annals of Mathematics is a bimonthly mathematical journal published by Princeton University and the Institute for Advanced Study.
New!!: Veblen's theorem and Annals of Mathematics · See more »
Canadian Journal of Mathematics
The Canadian Journal of Mathematics (Journal canadien de mathématiques; print:, online) is a bimonthly mathematics journal published by the Canadian Mathematical Society.
New!!: Veblen's theorem and Canadian Journal of Mathematics · See more »
Connectivity (graph theory)
In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) that need to be removed to disconnect the remaining nodes from each other.
New!!: Veblen's theorem and Connectivity (graph theory) · See more »
Cycle (graph theory)
In graph theory, a cycle is a path of edges and vertices wherein a vertex is reachable from itself.
New!!: Veblen's theorem and Cycle (graph theory) · See more »
Cycle basis
In graph theory, a branch of mathematics, a cycle basis of an undirected graph is a set of simple cycles that forms a basis of the cycle space of the graph.
New!!: Veblen's theorem and Cycle basis · See more »
Cycle double cover
In graph-theoretic mathematics, a cycle double cover is a collection of cycles in an undirected graph that together include each edge of the graph exactly twice.
New!!: Veblen's theorem and Cycle double cover · See more »
End (graph theory)
In the mathematics of infinite graphs, an end of a graph represents, intuitively, a direction in which the graph extends to infinity.
New!!: Veblen's theorem and End (graph theory) · See more »
Eulerian matroid
In matroid theory, an Eulerian matroid is a matroid whose elements can be partitioned into a collection of disjoint circuits.
New!!: Veblen's theorem and Eulerian matroid · See more »
Eulerian path
In graph theory, an Eulerian trail (or Eulerian path) is a trail in a finite graph which visits every edge exactly once.
New!!: Veblen's theorem and Eulerian path · See more »
Glossary of graph theory terms
This is a glossary of graph theory terms.
New!!: Veblen's theorem and Glossary of graph theory terms · See more »
