The following pages link to G.Merkel (Q803176):
Displaying 27 items.
- The relationship between the threshold dimension of split graphs and various dimensional parameters (Q803177) (← links)
- A cubic algorithm for the directed Eulerian subgraph problem (Q806684) (← links)
- A fixed cube theorem for median graphs (Q1092929) (← links)
- Large independent sets in shift-invariant graphs (Q1100485) (← links)
- Minisum location of a travelling salesman on simple networks (Q1107451) (← links)
- A graph theoretical approach to equivalence of multistage interconnection networks (Q1119597) (← links)
- A decomposition strategy for the vertex cover problem (Q1123907) (← links)
- An approach for the Steiner problem in directed graphs (Q1179756) (← links)
- Further comments on the subtree isomorphism for ordered trees (Q1183481) (← links)
- On graphs and codes (Q1184492) (← links)
- An extension of the multi-path algorithm for finding Hamilton cycles (Q1197026) (← links)
- Ends in spanning trees (Q1198517) (← links)
- Stability number of bull- and chair-free graphs (Q1208469) (← links)
- A branch and bound algorithm for symmetric 2-peripatetic salesman problems (Q1310005) (← links)
- Balancing problems in acyclic networks (Q1327220) (← links)
- The rectilinear class Steiner tree problem for intervals on two parallel lines (Q1327560) (← links)
- A lower bound for the shortest Hamiltonean path in directed graphs (Q1814249) (← links)
- Cut-threshold graphs (Q2277496) (← links)
- Quasiorthogonal dimension of Euclidean spaces (Q2367970) (← links)
- (Q3321862) (← links)
- (Q3325430) (← links)
- A moment method for solving stochastic time problems in network planning (Q3662984) (← links)
- (Q4126029) (← links)
- Einfluß der vertemnngsfunktionen der vorgangsdauern auf die ergebnisse von netzplanberechnungen (Q4168764) (← links)
- (Q4171853) (← links)
- (Q4770797) (← links)
- (Q5643769) (← links)
