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...
Certain graph families have also been characterized in terms of their maximal cliques or maximal independent sets. Examp...
Edge coloring Edges are colored List coloring Each vertex chooses from a list of colors List edge-coloring Each edge cho...
Special cases of degree value 3.1 Isolated vertex 3.2 Leaf vertex 3.3 Regular graph 3.4 Source 3.5 Sink 3.6 Eulerian gra...
In a directed graph, one can distinguish the outdegree (number of outgoing edges) from the indegree (number of incoming ...
Planar graphs and outerplanar graphs Graphs that can be embedded on any fixed two-dimensional manifold Forests and pseud...
