A closer look at Hamiltonicity and domination through the lens of diameter and convexity

A bipartite graph G ( X ,  Y ) is called a star-convex bipartite graph with convexity on X if there is an associated star T ( X ,  F ), such that for each vertex in Y , its neighborhood in X induces a subtree in T . A graph G is said to be a split graph if G can be partitioned into a clique ( K ) an...

Ausführliche Beschreibung