Let G be a locally finite infinite graph and let I(G) be the set of ends of G. The Freudenthal compactification of G is the topological space |G| which is obtained from the usual topological space of ...
Graph cover problems form a critical area within discrete optimisation and theoretical computer science, addressing the challenge of selecting subsets of vertices (or edges) that satisfy predetermined ...
Graph reconfiguration and colouring problems investigate the transition between feasible solutions of a graph colouring instance. The central challenge is to determine a series of elementary vertex ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results