Hamiltonian path for any given pair of (distinct) endvertices is a Hamiltonian connected graph . A graph that contains a...
Many of the following properties follow immediately from the standard way in which line graphs translate properties abou...
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 ...
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...
In mathematics , a random graph is a graph that is generated by some random process . The theory of random graphs lies a...
