Home | About | Tools
home » context search » edges

Matching Collections

graph - vertices
13 pages
vertices - graph
13 pages
graph - vertex
10 pages
vertex - graph
10 pages
vertex - vertices
8 pages
vertices - edges
8 pages
graph
32 pages
vertices
27 pages
vertex
26 pages
edges
16 pages
graph - graphs
16 pages
graphs
23 pages

Search within these results

acyclic
adjacency
adjacent
adjoint
adjunctions
algorithm
arc
balakrishnan
biconnected
bipartite
bollobas
category
clique
cocomplete
cocontinuous
colimits
comma
commute
connected
connectivity
crc
cycle
degree
denoted
diagram
diam
diestel
digraph
directed
disconnecting
disconnects
disjoint
dominating
edge
edges
endpoints
endvertices
eulerian
finite
functor
generalizations
graph
hamiltonian
harary
hyperedge
hypergraph
identity
indexing
induced
knot
labeled
lawvere
leaf
loops
matching
minimum
morphism
multigraph
multipartite
multiset
myrvold
neighbors
node
nonadjacent
object
pairwise
partite
path
planar
planarity
pseudograph
qualification
reachable
selecting
selection
sets
simplices
simplicial
slice
spanning
subgraph
trail
transitive
tree
undirected
vertex
vertices
walk
weighted
wiener
yellen
zwillinger

Matching Pages (3 found; page 1 of 1)

Comma category - Wikipedia

Limits and universal morphisms Colimits in comma categories may be "inherited". If and are cocomplete, is a cocontinuous functor, and another funct...

Graph (mathematics) - Wikipedia

Definitions 1.1 Graph 2 Types of graphs 2.1 Directed graph 2.2 Undirected graph 2.3 Finite graph 2.4 Simple graph 2.5 Regular graph 2.6 Weighted gr...

Glossary of graph theory - Wikipedia

Hamiltonian path for any given pair of (distinct) endvertices is a Hamiltonian connected graph . A graph that contains a Hamiltonian cycle is a Ham...

About Us | Feedback | Contact Us | ©2007 Trailfire Inc. All rights reserved.