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 Re...
Hamiltonian path for any given pair of (distinct) endvertices is a Hamiltonian connected graph . A graph that contains a...
In a directed graph, one can distinguish the outdegree (number of outgoing edges) from the indegree (number of incoming ...
Many of the following properties follow immediately from the standard way in which line graphs translate properties abou...
In graph theory , a path in a graph is a sequence of vertices such that from each of its vertices there is an edge to th...
Edge coloring Edges are colored List coloring Each vertex chooses from a list of colors List edge-coloring Each edge cho...
Planar graphs and outerplanar graphs Graphs that can be embedded on any fixed two-dimensional manifold Forests and pseud...
